Recognised as Number
7,909,401
- Positive
- Odd
- Composite
- 7 digits
7,909,401 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value7,909,401
Digit count7
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 23 × 79 × 1,451
Distinct prime factors43, 23, 79, 1,451
Number of divisors16
Sum of divisors σ(n)11,151,360
Aliquot sum3,241,959sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,976,400integers below n that share no factor with it
Carmichael function λ(n)622,050the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,976,400
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 23, 69, 79, 237, 1,451, 1,817, 4,353, 5,451, 33,373, 100,119, 114,629, 343,887, 2,636,467, 7,909,40116 in total
Arithmetic
Previous number7,909,400
Next number7,909,402
Double15,818,802
Half3,954,700.5
Square62,558,624,178,801
Cube494,801,244,638,432,808,201
Square root2,812.365730128≈irrational, shown to 9 decimal places
Cube root199.242140203≈
Negation-7,909,401
Reciprocal1.26431825 × 10^-7≈
Representations
Decimal7,909,401
Binary1111000101100000001100123 bits
Octal36130031
Hexadecimal78B019
Base 364PIXL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, nine hundred and nine thousand, four hundred and one
Ordinalseven million, nine hundred and nine thousand, four hundred and first
Scientific notation7.909401 × 10^6
Engineering notation7.909401 × 10^6
In other bases
Ternary112212211122210base 3; the most digit-efficient integer base after e: 15 digits
Quinary4011100101base 5; one hand: 10 digits
Septenary124141323base 7: 9 digits
Nonary15784583base 9; each digit is two ternary digits: 8 digits
Duodecimal2795249base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal298da1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal36:37:3:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00T00TTT00T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010011111000001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011110001011000000011001
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes378 b0 19
Gray code10001001110100000010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011110001011000000011001
64-bit0000000000000000000000000000000000000000011110001011000000011001
One's complement11111111100001110100111111100110at 32 bits, every bit flipped
Bits reversed10011000000011010001111000000000at 32 bits
Rotated left by 100000000111100010110000000110010at 32 bits, wrapping
Shifted left by 1111100010110000000110010= 15,818,802, no wrap
Shifted right by 11111000101100000001100= 3,954,700, discarding the low bit
These bits as a double3.90776331 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,909,401 to the power 262,558,624,178,801
7,909,401 to the power 3494,801,244,638,432,808,201
7,909,401 to the power 43,913,581,459,144,465,091,617,797,601
7,909,401 to the power 530,954,085,106,538,691,340,106,899,963,147,001
First ten multiples7,909,401, 15,818,802, 23,728,203, 31,637,604, 39,547,005, 47,456,406, 55,365,807, 63,275,208, 71,184,609, 79,094,010
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached26,694,2323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,909,401 → 23,728,204 → 11,864,102 → 5,932,051 → 17,796,154 → 8,898,077 → 26,694,232 → 13,347,116 → 6,673,558 → 3,336,779 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage790,940,100%
7,909,401% as a decimal79,094.01
7,909,401% of 1007,909,401
7,909,401% of 1,00079,094,010
As a fraction of 1007,909,401/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 7,909,401
Nerdulate something else
Nothing in mind? Surprise me · today’s page