Recognised as Number
9,726,087
- Positive
- Odd
- Composite
- 7 digits
9,726,087 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,726,087
Digit count7
Digit sum39
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 7 × 197 × 2,351
Distinct prime factors43, 7, 197, 2,351
Number of divisors16
Sum of divisors σ(n)14,902,272
Aliquot sum5,176,185sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,527,200integers below n that share no factor with it
Carmichael function λ(n)690,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,527,200
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 197, 591, 1,379, 2,351, 4,137, 7,053, 16,457, 49,371, 463,147, 1,389,441, 3,242,029, 9,726,08716 in total
Arithmetic
Previous number9,726,086
Next number9,726,088
Double19,452,174
Half4,863,043.5
Square94,596,768,331,569
Cube920,056,398,711,684,940,503
Square root3,118.667503919≈irrational, shown to 9 decimal places
Cube root213.458137964≈
Negation-9,726,087
Reciprocal1.02816271 × 10^-7≈
Representations
Decimal9,726,087
Binary10010100011010001000011124 bits
Octal45064207
Hexadecimal946887
Base 365SGP3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, seven hundred and twenty-six thousand and eighty-seven
Ordinalnine million, seven hundred and twenty-six thousand and eighty-seventh
Scientific notation9.726087 × 10^6
Engineering notation9.726087 × 10^6
In other bases
Ternary200022010200110base 3; the most digit-efficient integer base after e: 15 digits
Quinary4442213322base 5; one hand: 10 digits
Septenary145445640base 7: 9 digits
Nonary20263613base 9; each digit is two ternary digits: 8 digits
Duodecimal3310633base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal30ff47base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:1:41:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0010T011T00110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101011011100110011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101000110100010000111
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 68 87
Gray code110111100101110011000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101000110100010000111
64-bit0000000000000000000000000000000000000000100101000110100010000111
One's complement11111111011010111001011101111000at 32 bits, every bit flipped
Bits reversed11100001000101100010100100000000at 32 bits
Rotated left by 100000001001010001101000100001110at 32 bits, wrapping
Shifted left by 11001010001101000100001110= 19,452,174, no wrap
Shifted right by 110010100011010001000011= 4,863,043, discarding the low bit
These bits as a double4.80532546 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,726,087 to the power 294,596,768,331,569
9,726,087 to the power 3920,056,398,711,684,940,503
9,726,087 to the power 48,948,548,578,776,535,647,922,001,761
9,726,087 to the power 587,034,362,000,906,939,270,290,758,341,639,207
First ten multiples9,726,087, 19,452,174, 29,178,261, 38,904,348, 48,630,435, 58,356,522, 68,082,609, 77,808,696, 87,534,783, 97,260,870
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1176the total stopping time
Highest value reached65,651,0926× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,726,087 → 29,178,262 → 14,589,131 → 43,767,394 → 21,883,697 → 65,651,092 → 32,825,546 → 16,412,773 → 49,238,320 → 24,619,160 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage972,608,700%
9,726,087% as a decimal97,260.87
9,726,087% of 1009,726,087
9,726,087% of 1,00097,260,870
As a fraction of 1009,726,087/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,726,087
Nerdulate something else
Nothing in mind? Surprise me · today’s page