Recognised as Number
8,753,401
- Positive
- Odd
- Prime
- 7 digits
8,753,401 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,753,401
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation8,753,401
Distinct prime factors18,753,401
Number of divisors2
Sum of divisors σ(n)8,753,402
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,753,400integers below n that share no factor with it
Carmichael function λ(n)8,753,400the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 8,753,4012 in total
Arithmetic
Previous number8,753,400
Next number8,753,402
Double17,506,802
Half4,376,700.5
Square76,622,029,066,801
Cube670,703,345,855,364,940,201
Square root2,958.614709623≈irrational, shown to 9 decimal places
Cube root206.090959611≈
Negation-8,753,401
Reciprocal1.1424131 × 10^-7≈
Representations
Decimal8,753,401
Binary10000101100100001111100124 bits
Octal41310371
Hexadecimal8590F9
Base 3657M61
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, seven hundred and fifty-three thousand, four hundred and one
Ordinaleight million, seven hundred and fifty-three thousand, four hundred and first
Scientific notation8.753401 × 10^6
Engineering notation8.753401 × 10^6
In other bases
Ternary121110201102001base 3; the most digit-efficient integer base after e: 15 digits
Quinary4220102101base 5; one hand: 10 digits
Septenary134255056base 7: 9 digits
Nonary17421361base 9; each digit is two ternary digits: 8 digits
Duodecimal2b21761base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2ee3a1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal40:31:30:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1111T0111T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100110101001000100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100001011001000011111001
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes385 90 f9
Gray code110001110101100010000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100001011001000011111001
64-bit0000000000000000000000000000000000000000100001011001000011111001
One's complement11111111011110100110111100000110at 32 bits, every bit flipped
Bits reversed10011111000010011010000100000000at 32 bits
Rotated left by 100000001000010110010000111110010at 32 bits, wrapping
Shifted left by 11000010110010000111110010= 17,506,802, no wrap
Shifted right by 110000101100100001111100= 4,376,700, discarding the low bit
These bits as a double4.32475472 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,753,401 to the power 276,622,029,066,801
8,753,401 to the power 3670,703,345,855,364,940,201
8,753,401 to the power 45,870,935,338,313,697,322,920,373,601
8,753,401 to the power 551,390,651,261,330,456,460,148,521,199,367,001
First ten multiples8,753,401, 17,506,802, 26,260,203, 35,013,604, 43,767,005, 52,520,406, 61,273,807, 70,027,208, 78,780,609, 87,534,010
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1181the total stopping time
Highest value reached42,063,7844× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,753,401 → 26,260,204 → 13,130,102 → 6,565,051 → 19,695,154 → 9,847,577 → 29,542,732 → 14,771,366 → 7,385,683 → 22,157,050 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage875,340,100%
8,753,401% as a decimal87,534.01
8,753,401% of 1008,753,401
8,753,401% of 1,00087,534,010
As a fraction of 1008,753,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 8,753,401
Nerdulate something else
Nothing in mind? Surprise me · today’s page