Recognised as Number
9,687,751
- Positive
- Odd
- Prime
- 7 digits
9,687,751 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,687,751
Digit count7
Digit sum43
Digit product105,840
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,687,751
Distinct prime factors19,687,751
Number of divisors2
Sum of divisors σ(n)9,687,752
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,687,750integers below n that share no factor with it
Carmichael function λ(n)9,687,750the 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,687,7512 in total
Arithmetic
Previous number9,687,750
Next number9,687,752
Double19,375,502
Half4,843,875.5
Square93,852,519,438,001
Cube909,219,839,038,013,625,751
Square root3,112.515220846≈irrational, shown to 9 decimal places
Cube root213.177315669≈
Negation-9,687,751
Reciprocal1.03223132 × 10^-7≈
Representations
Decimal9,687,751
Binary10010011110100101100011124 bits
Octal44751307
Hexadecimal93D2C7
Base 365RN47
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, six hundred and eighty-seven thousand, seven hundred and fifty-one
Ordinalnine million, six hundred and eighty-seven thousand, seven hundred and fifty-first
Scientific notation9.687751 × 10^6
Engineering notation9.687751 × 10^6
In other bases
Ternary200020012002121base 3; the most digit-efficient integer base after e: 15 digits
Quinary4440002001base 5; one hand: 10 digits
Septenary145226113base 7: 9 digits
Nonary20205077base 9; each digit is two ternary digits: 8 digits
Duodecimal32b2407base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal30aj7bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal44:51:2:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T01TT010TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101001101011111011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100100111101001011000111
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 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
Bytes393 d2 c7
Gray code110110100011101110100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100100111101001011000111
64-bit0000000000000000000000000000000000000000100100111101001011000111
One's complement11111111011011000010110100111000at 32 bits, every bit flipped
Bits reversed11100011010010111100100100000000at 32 bits
Rotated left by 100000001001001111010010110001110at 32 bits, wrapping
Shifted left by 11001001111010010110001110= 19,375,502, no wrap
Shifted right by 110010011110100101100011= 4,843,875, discarding the low bit
These bits as a double4.78638495 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,687,751 to the power 293,852,519,438,001
9,687,751 to the power 3909,219,839,038,013,625,751
9,687,751 to the power 48,808,295,404,860,355,540,882,876,001
9,687,751 to the power 585,332,572,616,731,314,251,543,622,861,563,751
First ten multiples9,687,751, 19,375,502, 29,063,253, 38,751,004, 48,438,755, 58,126,506, 67,814,257, 77,502,008, 87,189,759, 96,877,510
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 51
Collatz (3n + 1) trajectory
Steps to reach 1207the total stopping time
Highest value reached65,392,3246× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,687,751 → 29,063,254 → 14,531,627 → 43,594,882 → 21,797,441 → 65,392,324 → 32,696,162 → 16,348,081 → 49,044,244 → 24,522,122 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage968,775,100%
9,687,751% as a decimal96,877.51
9,687,751% of 1009,687,751
9,687,751% of 1,00096,877,510
As a fraction of 1009,687,751/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,687,751
Nerdulate something else
Nothing in mind? Surprise me · today’s page