Recognised as Number
8,313,989
- Positive
- Odd
- Prime
- 7 digits
8,313,989 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,313,989
Digit count7
Digit sum41
Digit product46,656
Multiplicative persistence3times 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,313,989
Distinct prime factors18,313,989
Number of divisors2
Sum of divisors σ(n)8,313,990
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,313,988integers below n that share no factor with it
Carmichael function λ(n)8,313,988the 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,313,9892 in total
Arithmetic
Previous number8,313,988
Next number8,313,990
Double16,627,978
Half4,156,994.5
Square69,122,413,092,121
Cube574,682,982,101,349,980,669
Square root2,883.398862454≈irrational, shown to 9 decimal places
Cube root202.58307012≈
Negation-8,313,989
Reciprocal1.20279207 × 10^-7≈
Representations
Decimal8,313,989
Binary1111110110111001000010123 bits
Octal37556205
Hexadecimal7EDC85
Base 364Y745
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, three hundred and thirteen thousand, nine hundred and eighty-nine
Ordinaleight million, three hundred and thirteen thousand, nine hundred and eighty-ninth
Scientific notation8.313989 × 10^6
Engineering notation8.313989 × 10^6
In other bases
Ternary120122101122112base 3; the most digit-efficient integer base after e: 15 digits
Quinary4112021424base 5; one hand: 10 digits
Septenary130445015base 7: 9 digits
Nonary16571575base 9; each digit is two ternary digits: 8 digits
Duodecimal294b405base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2bj4j9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal38:29:26:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1T0T11TT00TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000110010110110000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011111101101110010000101
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes37e dc 85
Gray code10000011011001011000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011111101101110010000101
64-bit0000000000000000000000000000000000000000011111101101110010000101
One's complement11111111100000010010001101111010at 32 bits, every bit flipped
Bits reversed10100001001110110111111000000000at 32 bits
Rotated left by 100000000111111011011100100001010at 32 bits, wrapping
Shifted left by 1111111011011100100001010= 16,627,978, no wrap
Shifted right by 11111110110111001000010= 4,156,994, discarding the low bit
These bits as a double4.10765634 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,313,989 to the power 269,122,413,092,121
8,313,989 to the power 3574,682,982,101,349,980,669
8,313,989 to the power 44,777,907,991,677,820,624,432,278,641
8,313,989 to the power 539,723,474,485,821,492,215,503,095,866,208,949
First ten multiples8,313,989, 16,627,978, 24,941,967, 33,255,956, 41,569,945, 49,883,934, 58,197,923, 66,511,912, 74,825,901, 83,139,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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1160the total stopping time
Highest value reached24,941,9683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,313,989 → 24,941,968 → 12,470,984 → 6,235,492 → 3,117,746 → 1,558,873 → 4,676,620 → 2,338,310 → 1,169,155 → 3,507,466 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage831,398,900%
8,313,989% as a decimal83,139.89
8,313,989% of 1008,313,989
8,313,989% of 1,00083,139,890
As a fraction of 1008,313,989/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,313,989
Nerdulate something else
Nothing in mind? Surprise me · today’s page