Recognised as Number
9,837,161
- Positive
- Odd
- Prime
- 7 digits
9,837,161 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,837,161
Digit count7
Digit sum35
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,837,161
Distinct prime factors19,837,161
Number of divisors2
Sum of divisors σ(n)9,837,162
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,837,160integers below n that share no factor with it
Carmichael function λ(n)9,837,160the 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,837,1612 in total
Arithmetic
Previous number9,837,160
Next number9,837,162
Double19,674,322
Half4,918,580.5
Square96,769,736,539,921
Cube951,939,478,270,785,804,281
Square root3,136.424875555≈irrational, shown to 9 decimal places
Cube root214.267643407≈
Negation-9,837,161
Reciprocal1.01655345 × 10^-7≈
Representations
Decimal9,837,161
Binary10010110000110100110100124 bits
Octal45415151
Hexadecimal961A69
Base 365UUEH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and thirty-seven thousand, one hundred and sixty-one
Ordinalnine million, eight hundred and thirty-seven thousand, one hundred and sixty-first
Scientific notation9.837161 × 10^6
Engineering notation9.837161 × 10^6
In other bases
Ternary200111210001022base 3; the most digit-efficient integer base after e: 15 digits
Quinary10004242121base 5; one hand: 11 digits
Septenary146420525base 7: 9 digits
Nonary20453038base 9; each digit is two ternary digits: 8 digits
Duodecimal3364975base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal319ci1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:32:32:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01TTTT1000110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010100110111110111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101100001101001101001
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 set bits, so odd; 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
Bytes396 1a 69
Gray code110111010001011101011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101100001101001101001
64-bit0000000000000000000000000000000000000000100101100001101001101001
One's complement11111111011010011110010110010110at 32 bits, every bit flipped
Bits reversed10010110010110000110100100000000at 32 bits
Rotated left by 100000001001011000011010011010010at 32 bits, wrapping
Shifted left by 11001011000011010011010010= 19,674,322, no wrap
Shifted right by 110010110000110100110100= 4,918,580, discarding the low bit
These bits as a double4.8602033 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,837,161 to the power 296,769,736,539,921
9,837,161 to the power 3951,939,478,270,785,804,281
9,837,161 to the power 49,364,381,910,005,721,553,226,686,241
9,837,161 to the power 592,118,932,514,213,793,840,260,982,049,201,801
First ten multiples9,837,161, 19,674,322, 29,511,483, 39,348,644, 49,185,805, 59,022,966, 68,860,127, 78,697,288, 88,534,449, 98,371,610
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1282the total stopping time
Highest value reached74,700,9527× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,837,161 → 29,511,484 → 14,755,742 → 7,377,871 → 22,133,614 → 11,066,807 → 33,200,422 → 16,600,211 → 49,800,634 → 24,900,317 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage983,716,100%
9,837,161% as a decimal98,371.61
9,837,161% of 1009,837,161
9,837,161% of 1,00098,371,610
As a fraction of 1009,837,161/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,837,161
Nerdulate something else
Nothing in mind? Surprise me · today’s page