Recognised as Number
8,313,997
- Positive
- Odd
- Composite
- 7 digits
8,313,997 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value8,313,997
Digit count7
Digit sum40
Digit product40,824
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation881 × 9,437
Distinct prime factors2881, 9,437
Number of divisors4
Sum of divisors σ(n)8,324,316
Aliquot sum10,319sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,303,680integers below n that share no factor with it
Carmichael function λ(n)2,075,920the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,303,680
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 881, 9,437, 8,313,9974 in total
Arithmetic
Previous number8,313,996
Next number8,313,998
Double16,627,994
Half4,156,998.5
Square69,122,546,116,009
Cube574,684,641,040,860,477,973
Square root2,883.400249705≈irrational, shown to 9 decimal places
Cube root202.583135097≈
Negation-8,313,997
Reciprocal1.20279091 × 10^-7≈
Representations
Decimal8,313,997
Binary1111110110111001000110123 bits
Octal37556215
Hexadecimal7EDC8D
Base 364Y74D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, three hundred and thirteen thousand, nine hundred and ninety-seven
Ordinaleight million, three hundred and thirteen thousand, nine hundred and ninety-seventh
Scientific notation8.313997 × 10^6
Engineering notation8.313997 × 10^6
In other bases
Ternary120122101122211base 3; the most digit-efficient integer base after e: 15 digits
Quinary4112021442base 5; one hand: 10 digits
Septenary130445026base 7: 9 digits
Nonary16571584base 9; each digit is two ternary digits: 8 digits
Duodecimal294b411base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2bj4jhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal38:29:26:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1T0T11TT00T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000110010110110011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011111101101110010001101
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 set bits, so odd; 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 8d
Gray code10000011011001011001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011111101101110010001101
64-bit0000000000000000000000000000000000000000011111101101110010001101
One's complement11111111100000010010001101110010at 32 bits, every bit flipped
Bits reversed10110001001110110111111000000000at 32 bits
Rotated left by 100000000111111011011100100011010at 32 bits, wrapping
Shifted left by 1111111011011100100011010= 16,627,994, no wrap
Shifted right by 11111110110111001000110= 4,156,998, discarding the low bit
These bits as a double4.1076603 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,313,997 to the power 269,122,546,116,009
8,313,997 to the power 3574,684,641,040,860,477,973
8,313,997 to the power 44,777,926,381,559,790,891,286,088,081
8,313,997 to the power 539,723,665,602,508,956,790,779,862,447,169,757
First ten multiples8,313,997, 16,627,994, 24,941,991, 33,255,988, 41,569,985, 49,883,982, 58,197,979, 66,511,976, 74,825,973, 83,139,970
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 193the total stopping time
Highest value reached24,941,9923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,313,997 → 24,941,992 → 12,470,996 → 6,235,498 → 3,117,749 → 9,353,248 → 4,676,624 → 2,338,312 → 1,169,156 → 584,578 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage831,399,700%
8,313,997% as a decimal83,139.97
8,313,997% of 1008,313,997
8,313,997% of 1,00083,139,970
As a fraction of 1008,313,997/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,997
Nerdulate something else
Nothing in mind? Surprise me · today’s page