Recognised as Number
9,897,617
- Positive
- Odd
- Prime
- 7 digits
9,897,617 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,897,617
Digit count7
Digit sum47
Digit product190,512
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,897,617
Distinct prime factors19,897,617
Number of divisors2
Sum of divisors σ(n)9,897,618
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,897,616integers below n that share no factor with it
Carmichael function λ(n)9,897,616the 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, 9,897,6172 in total
Arithmetic
Previous number9,897,616
Next number9,897,618
Double19,795,234
Half4,948,808.5
Square97,962,822,278,689
Cube969,598,495,153,530,984,113
Square root3,146.047838161≈irrational, shown to 9 decimal places
Cube root214.705687078≈
Negation-9,897,617
Reciprocal1.01034421 × 10^-7≈
Representations
Decimal9,897,617
Binary10010111000001101001000124 bits
Octal45603221
Hexadecimal970691
Base 365W51T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and ninety-seven thousand, six hundred and seventeen
Ordinalnine million, eight hundred and ninety-seven thousand, six hundred and seventeenth
Scientific notation9.897617 × 10^6
Engineering notation9.897617 × 10^6
In other bases
Ternary200121211222102base 3; the most digit-efficient integer base after e: 15 digits
Quinary10013210432base 5; one hand: 11 digits
Septenary150062012base 7: 9 digits
Nonary20554872base 9; each digit is two ternary digits: 8 digits
Duodecimal3393955base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal31h40hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:49:20:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T0T0TT00T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010110001101110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101110000011010010001
Bit length24 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits14within that length
Bit parityeven10 set bits, so even; 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
Bytes397 06 91
Gray code110111001000010111011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101110000011010010001
64-bit0000000000000000000000000000000000000000100101110000011010010001
One's complement11111111011010001111100101101110at 32 bits, every bit flipped
Bits reversed10001001011000001110100100000000at 32 bits
Rotated left by 100000001001011100000110100100010at 32 bits, wrapping
Shifted left by 11001011100000110100100010= 19,795,234, no wrap
Shifted right by 110010111000001101001000= 4,948,808, discarding the low bit
These bits as a double4.89007254 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,897,617 to the power 297,962,822,278,689
9,897,617 to the power 3969,598,495,153,530,984,113
9,897,617 to the power 49,596,714,548,806,005,878,383,558,721
9,897,617 to the power 594,984,605,062,409,653,483,989,043,317,467,857
First ten multiples9,897,617, 19,795,234, 29,692,851, 39,590,468, 49,488,085, 59,385,702, 69,283,319, 79,180,936, 89,078,553, 98,976,170
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1189the total stopping time
Highest value reached29,692,8523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,897,617 → 29,692,852 → 14,846,426 → 7,423,213 → 22,269,640 → 11,134,820 → 5,567,410 → 2,783,705 → 8,351,116 → 4,175,558 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage989,761,700%
9,897,617% as a decimal98,976.17
9,897,617% of 1009,897,617
9,897,617% of 1,00098,976,170
As a fraction of 1009,897,617/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 9,897,617
Nerdulate something else
Nothing in mind? Surprise me · today’s page