Nerdulator> put something in

Recognised as Number

9,701,687

  • Positive
  • Odd
  • Prime
  • 7 digits

9,701,687 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,701,687
Digit count7
Digit sum38
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation9,701,687
Distinct prime factors19,701,687
Number of divisors2
Sum of divisors σ(n)9,701,688
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,701,686integers below n that share no factor with it
Carmichael function λ(n)9,701,686the 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,701,6872 in total

Arithmetic

Previous number9,701,686
Next number9,701,688
Cube913,149,272,312,499,049,703
Square root3,114.753120233≈irrational, shown to 9 decimal places
Cube root213.279486464≈
Negation-9,701,687
Reciprocal1.03074857 × 10^-7≈

Representations

Decimal9,701,687
Binary10010100000010010011011124 bits
Octal45004467
Hexadecimal940937
Base 365RXVB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, seven hundred and one thousand, six hundred and eighty-seven
Ordinalnine million, seven hundred and one thousand, six hundred and eighty-seventh
Scientific notation9.701687 × 10^6
Engineering notation9.701687 × 10^6

In other bases

Ternary200020220012202base 3; the most digit-efficient integer base after e: 15 digits
Quinary4440423222base 5; one hand: 10 digits
Septenary145314542base 7: 9 digits
Nonary20226182base 9; each digit is two ternary digits: 8 digits
Duodecimal32ba49bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal30ce47base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal44:54:54:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T10T01T0T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101000001100101001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100101000000100100110111
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
Bytes394 09 37
Gray code110111100000110110101100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100101000000100100110111
64-bit0000000000000000000000000000000000000000100101000000100100110111
One's complement11111111011010111111011011001000at 32 bits, every bit flipped
Bits reversed11101100100100000010100100000000at 32 bits
Rotated left by 100000001001010000001001001101110at 32 bits, wrapping
Shifted left by 11001010000001001001101110= 19,403,374, no wrap
Shifted right by 110010100000010010011011= 4,850,843, discarding the low bit
These bits as a double4.79327025 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,701,701+14
Previous prime9,701,677−10
Distance to nearest prime0, it is prime
Nearest square below9,696,996
Nearest square above9,703,225

Powers & multiples

9,701,687 to the power 294,122,730,645,969
9,701,687 to the power 3913,149,272,312,499,049,703
9,701,687 to the power 48,859,088,424,253,631,968,015,948,961
9,701,687 to the power 585,948,102,997,431,945,966,884,747,827,597,207
First ten multiples9,701,687, 19,403,374, 29,105,061, 38,806,748, 48,508,435, 58,210,122, 67,911,809, 77,613,496, 87,315,183, 97,016,870
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 87

Collatz (3n + 1) trajectory

Steps to reach 1176the total stopping time
Highest value reached65,486,3926× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,701,687 → 29,105,062 → 14,552,531 → 43,657,594 → 21,828,797 → 65,486,392 → 32,743,196 → 16,371,598 → 8,185,799 → 24,557,398 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage970,168,700%
9,701,687% as a decimal97,016.87
9,701,687% of 1009,701,687
9,701,687% of 1,00097,016,870
As a fraction of 1009,701,687/100

Read another way

As bytes9.252 MiB
As a 24-bit colour#940937

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 “9701687” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.