Recognised as Number
5,989,667
- Positive
- Odd
- Prime
- 7 digits
5,989,667 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 value5,989,667
Digit count7
Digit sum50
Digit product816,480
Multiplicative persistence2times 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 factorisation5,989,667
Distinct prime factors15,989,667
Number of divisors2
Sum of divisors σ(n)5,989,668
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,989,666integers below n that share no factor with it
Carmichael function λ(n)5,989,666the 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, 5,989,6672 in total
Arithmetic
Previous number5,989,666
Next number5,989,668
Double11,979,334
Half2,994,833.5
Square35,876,110,770,889
Cube214,885,956,772,738,403,963
Square root2,447.379619103≈irrational, shown to 9 decimal places
Cube root181.607686527≈
Negation-5,989,667
Reciprocal1.6695419 × 10^-7≈
Representations
Decimal5,989,667
Binary1011011011001010010001123 bits
Octal26662443
Hexadecimal5B6523
Base 363KDNN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, nine hundred and eighty-nine thousand, six hundred and sixty-seven
Ordinalfive million, nine hundred and eighty-nine thousand, six hundred and sixty-seventh
Scientific notation5.989667 × 10^6
Engineering notation5.989667 × 10^6
In other bases
Ternary102021022021112base 3; the most digit-efficient integer base after e: 15 digits
Quinary3013132132base 5; one hand: 10 digits
Septenary101624405base 7: 9 digits
Nonary12238245base 9; each digit is two ternary digits: 8 digits
Duodecimal200a2abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1h8e37base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal27:43:47:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1T110T10TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011001010010101100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010110110110010100100011
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
Bytes35b 65 23
Gray code11101101101011110110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010110110110010100100011
64-bit0000000000000000000000000000000000000000010110110110010100100011
One's complement11111111101001001001101011011100at 32 bits, every bit flipped
Bits reversed11000100101001101101101000000000at 32 bits
Rotated left by 100000000101101101100101001000110at 32 bits, wrapping
Shifted left by 1101101101100101001000110= 11,979,334, no wrap
Shifted right by 11011011011001010010001= 2,994,833, discarding the low bit
These bits as a double2.95928869 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,989,667 to the power 235,876,110,770,889
5,989,667 to the power 3214,885,956,772,738,403,963
5,989,667 to the power 41,287,095,324,045,097,717,849,850,321
5,989,667 to the power 57,709,272,388,287,228,312,380,559,422,633,107
First ten multiples5,989,667, 11,979,334, 17,969,001, 23,958,668, 29,948,335, 35,938,002, 41,927,669, 47,917,336, 53,907,003, 59,896,670
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1227the total stopping time
Highest value reached26,953,5044× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,989,667 → 17,969,002 → 8,984,501 → 26,953,504 → 13,476,752 → 6,738,376 → 3,369,188 → 1,684,594 → 842,297 → 2,526,892 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage598,966,700%
5,989,667% as a decimal59,896.67
5,989,667% of 1005,989,667
5,989,667% of 1,00059,896,670
As a fraction of 1005,989,667/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 5,989,667
Nerdulate something else
Nothing in mind? Surprise me · today’s page