Nerdulator> put something in

Recognised as Number

9,807,359

  • Positive
  • Odd
  • Prime
  • 7 digits

9,807,359 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 value9,807,359
Digit count7
Digit sum41
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation9,807,359
Distinct prime factors19,807,359
Number of divisors2
Sum of divisors σ(n)9,807,360
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,807,358integers below n that share no factor with it
Carmichael function λ(n)9,807,358the 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,807,3592 in total

Arithmetic

Previous number9,807,358
Next number9,807,360
Cube943,313,867,632,027,169,279
Square root3,131.670321091≈irrational, shown to 9 decimal places
Cube root214.051047594≈
Negation-9,807,359
Reciprocal1.01964249 × 10^-7≈

Representations

Decimal9,807,359
Binary10010101101001011111111124 bits
Octal45322777
Hexadecimal95A5FF
Base 365U7EN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and seven thousand, three hundred and fifty-nine
Ordinalnine million, eight hundred and seven thousand, three hundred and fifty-ninth
Scientific notation9.807359 × 10^6
Engineering notation9.807359 × 10^6

In other bases

Ternary200110021011112base 3; the most digit-efficient integer base after e: 15 digits
Quinary10002313414base 5; one hand: 11 digits
Septenary146234612base 7: 9 digits
Nonary20407145base 9; each digit is two ternary digits: 8 digits
Duodecimal334b67bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal315i7jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:24:15:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001101T11TTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010101111101000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100101011010010111111111
Bit length24 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits8within that length
Bit parityeven16 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
Bytes395 a5 ff
Gray code110111110111011100000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100101011010010111111111
64-bit0000000000000000000000000000000000000000100101011010010111111111
One's complement11111111011010100101101000000000at 32 bits, every bit flipped
Bits reversed11111111101001011010100100000000at 32 bits
Rotated left by 100000001001010110100101111111110at 32 bits, wrapping
Shifted left by 11001010110100101111111110= 19,614,718, no wrap
Shifted right by 110010101101001011111111= 4,903,679, discarding the low bit
These bits as a double4.84547916 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,807,367+8
Previous prime9,807,353−6
Distance to nearest prime0, it is prime
Nearest square below9,803,161
Nearest square above9,809,424

Powers & multiples

9,807,359 to the power 296,184,290,554,881
9,807,359 to the power 3943,313,867,632,027,169,279
9,807,359 to the power 49,251,417,749,545,770,346,872,924,161
9,807,359 to the power 590,731,975,128,767,456,723,337,294,626,700,799
First ten multiples9,807,359, 19,614,718, 29,422,077, 39,229,436, 49,036,795, 58,844,154, 68,651,513, 78,458,872, 88,266,231, 98,073,590
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 1207the total stopping time
Highest value reached754,055,72876× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,807,359 → 29,422,078 → 14,711,039 → 44,133,118 → 22,066,559 → 66,199,678 → 33,099,839 → 99,299,518 → 49,649,759 → 148,949,278 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage980,735,900%
9,807,359% as a decimal98,073.59
9,807,359% of 1009,807,359
9,807,359% of 1,00098,073,590
As a fraction of 1009,807,359/100

Read another way

As bytes9.353 MiB
As a 24-bit colour#95A5FF

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “9807359” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.