Recognised as Number
8,487,329
- Positive
- Odd
- Prime
- 7 digits
8,487,329 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,487,329
Digit count7
Digit sum41
Digit product96,768
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation8,487,329
Distinct prime factors18,487,329
Number of divisors2
Sum of divisors σ(n)8,487,330
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,487,328integers below n that share no factor with it
Carmichael function λ(n)8,487,328the 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,487,3292 in total
Arithmetic
Previous number8,487,328
Next number8,487,330
Double16,974,658
Half4,243,664.5
Square72,034,753,554,241
Cube611,382,652,848,762,712,289
Square root2,913.302078398≈irrational, shown to 9 decimal places
Cube root203.981295543≈
Negation-8,487,329
Reciprocal1.17822698 × 10^-7≈
Representations
Decimal8,487,329
Binary10000001100000011010000124 bits
Octal40300641
Hexadecimal8181A1
Base 3651WV5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, four hundred and eighty-seven thousand, three hundred and twenty-nine
Ordinaleight million, four hundred and eighty-seven thousand, three hundred and twenty-ninth
Scientific notation8.487329 × 10^6
Engineering notation8.487329 × 10^6
In other bases
Ternary120222012102112base 3; the most digit-efficient integer base after e: 15 digits
Quinary4133043304base 5; one hand: 10 digits
Septenary132066254base 7: 9 digits
Nonary16865375base 9; each digit is two ternary digits: 8 digits
Duodecimal2a13795base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2d0i69base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal39:17:35:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT100T1TT110TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100001101000011011100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100000011000000110100001
Bit length24 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits17within that length
Bit parityodd7 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
Bytes381 81 a1
Gray code110000010100000101110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100000011000000110100001
64-bit0000000000000000000000000000000000000000100000011000000110100001
One's complement11111111011111100111111001011110at 32 bits, every bit flipped
Bits reversed10000101100000011000000100000000at 32 bits
Rotated left by 100000001000000110000001101000010at 32 bits, wrapping
Shifted left by 11000000110000001101000010= 16,974,658, no wrap
Shifted right by 110000001100000011010000= 4,243,664, discarding the low bit
These bits as a double4.19329768 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,487,329 to the power 272,034,753,554,241
8,487,329 to the power 3611,382,652,848,762,712,289
8,487,329 to the power 45,189,005,719,620,236,382,129,086,081
8,487,329 to the power 544,040,798,725,298,701,232,899,274,038,767,649
First ten multiples8,487,329, 16,974,658, 25,461,987, 33,949,316, 42,436,645, 50,923,974, 59,411,303, 67,898,632, 76,385,961, 84,873,290
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1150the total stopping time
Highest value reached73,496,3208× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,487,329 → 25,461,988 → 12,730,994 → 6,365,497 → 19,096,492 → 9,548,246 → 4,774,123 → 14,322,370 → 7,161,185 → 21,483,556 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage848,732,900%
8,487,329% as a decimal84,873.29
8,487,329% of 1008,487,329
8,487,329% of 1,00084,873,290
As a fraction of 1008,487,329/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,487,329
Nerdulate something else
Nothing in mind? Surprise me · today’s page