Recognised as Number
9,489,131
- Positive
- Odd
- Composite
- 7 digits
9,489,131 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,489,131
Digit count7
Digit sum35
Digit product7,776
Multiplicative persistence3times 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 factorisation31 × 37 × 8,273
Distinct prime factors331, 37, 8,273
Number of divisors8
Sum of divisors σ(n)10,061,184
Aliquot sum572,053sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,933,760integers below n that share no factor with it
Carmichael function λ(n)372,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,933,760
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 31, 37, 1,147, 8,273, 256,463, 306,101, 9,489,1318 in total
Arithmetic
Previous number9,489,130
Next number9,489,132
Double18,978,262
Half4,744,565.5
Square90,043,607,135,161
Cube854,435,583,818,077,435,091
Square root3,080.443312252≈irrational, shown to 9 decimal places
Cube root211.710377922≈
Negation-9,489,131
Reciprocal1.05383728 × 10^-7≈
Representations
Decimal9,489,131
Binary10010000110010101110101124 bits
Octal44145353
Hexadecimal90CAEB
Base 365NDUZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, four hundred and eighty-nine thousand, one hundred and thirty-one
Ordinalnine million, four hundred and eighty-nine thousand, one hundred and thirty-first
Scientific notation9.489131 × 10^6
Engineering notation9.489131 × 10^6
In other bases
Ternary122212002122022base 3; the most digit-efficient integer base after e: 15 digits
Quinary4412123011base 5; one hand: 10 digits
Septenary143441051base 7: 9 digits
Nonary18762568base 9; each digit is two ternary digits: 8 digits
Duodecimal321748bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2j62gbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:55:52:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000TT010T0T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100011101111100111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100100001100101011101011
Bit length24 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits12within that length
Bit parityeven12 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
Bytes390 ca eb
Gray code110110001010111110011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100100001100101011101011
64-bit0000000000000000000000000000000000000000100100001100101011101011
One's complement11111111011011110011010100010100at 32 bits, every bit flipped
Bits reversed11010111010100110000100100000000at 32 bits
Rotated left by 100000001001000011001010111010110at 32 bits, wrapping
Shifted left by 11001000011001010111010110= 18,978,262, no wrap
Shifted right by 110010000110010101110101= 4,744,565, discarding the low bit
These bits as a double4.68825364 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,489,131 to the power 290,043,607,135,161
9,489,131 to the power 3854,435,583,818,077,435,091
9,489,131 to the power 48,107,851,185,911,216,949,722,495,921
9,489,131 to the power 576,936,462,031,616,892,005,337,177,441,334,651
First ten multiples9,489,131, 18,978,262, 28,467,393, 37,956,524, 47,445,655, 56,934,786, 66,423,917, 75,913,048, 85,402,179, 94,891,310
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1106the total stopping time
Highest value reached54,043,5765× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,489,131 → 28,467,394 → 14,233,697 → 42,701,092 → 21,350,546 → 10,675,273 → 32,025,820 → 16,012,910 → 8,006,455 → 24,019,366 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage948,913,100%
9,489,131% as a decimal94,891.31
9,489,131% of 1009,489,131
9,489,131% of 1,00094,891,310
As a fraction of 1009,489,131/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,489,131
Nerdulate something else
Nothing in mind? Surprise me · today’s page