Recognised as Number
8,132,389
- Positive
- Odd
- Prime
- 7 digits
8,132,389 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,132,389
Digit count7
Digit sum34
Digit product10,368
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation8,132,389
Distinct prime factors18,132,389
Number of divisors2
Sum of divisors σ(n)8,132,390
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,132,388integers below n that share no factor with it
Carmichael function λ(n)8,132,388the 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,132,3892 in total
Arithmetic
Previous number8,132,388
Next number8,132,390
Double16,264,778
Half4,066,194.5
Square66,135,750,847,321
Cube537,841,652,697,493,979,869
Square root2,851.734384546≈irrational, shown to 9 decimal places
Cube root201.097211296≈
Negation-8,132,389
Reciprocal1.22965097 × 10^-7≈
Representations
Decimal8,132,389
Binary1111100000101110010010123 bits
Octal37013445
Hexadecimal7C1725
Base 364UAZP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, one hundred and thirty-two thousand, three hundred and eighty-nine
Ordinaleight million, one hundred and thirty-two thousand, three hundred and eighty-ninth
Scientific notation8.132389 × 10^6
Engineering notation8.132389 × 10^6
In other bases
Ternary120022011112121base 3; the most digit-efficient integer base after e: 15 digits
Quinary4040214024base 5; one hand: 10 digits
Septenary126060406base 7: 9 digits
Nonary16264477base 9; each digit is two ternary digits: 8 digits
Duodecimal28822b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2agaj9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal37:38:59:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT010T1TTTT0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011000110101101100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011111000001011100100101
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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
Bytes37c 17 25
Gray code10000100001110010110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011111000001011100100101
64-bit0000000000000000000000000000000000000000011111000001011100100101
One's complement11111111100000111110100011011010at 32 bits, every bit flipped
Bits reversed10100100111010000011111000000000at 32 bits
Rotated left by 100000000111110000010111001001010at 32 bits, wrapping
Shifted left by 1111110000010111001001010= 16,264,778, no wrap
Shifted right by 11111100000101110010010= 4,066,194, discarding the low bit
These bits as a double4.01793402 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,132,389 to the power 266,135,750,847,321
8,132,389 to the power 3537,841,652,697,493,979,869
8,132,389 to the power 44,373,937,540,138,920,369,452,877,041
8,132,389 to the power 535,570,561,538,112,814,484,414,513,266,580,949
First ten multiples8,132,389, 16,264,778, 24,397,167, 32,529,556, 40,661,945, 48,794,334, 56,926,723, 65,059,112, 73,191,501, 81,323,890
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached24,397,1683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,132,389 → 24,397,168 → 12,198,584 → 6,099,292 → 3,049,646 → 1,524,823 → 4,574,470 → 2,287,235 → 6,861,706 → 3,430,853 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage813,238,900%
8,132,389% as a decimal81,323.89
8,132,389% of 1008,132,389
8,132,389% of 1,00081,323,890
As a fraction of 1008,132,389/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,132,389
Nerdulate something else
Nothing in mind? Surprise me · today’s page