Recognised as Number
9,010,644
- Positive
- Even
- Composite
- 7 digits
9,010,644 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value9,010,644
Digit count7
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 313 × 2,399
Distinct prime factors42, 3, 313, 2,399
Number of divisors24
Sum of divisors σ(n)21,100,800
Aliquot sum12,090,156sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)2,992,704integers below n that share no factor with it
Carmichael function λ(n)374,088the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,992,704
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 313, 626, 939, 1,252, 1,878, 2,399, 3,756, 4,798, 7,197, 9,596, 14,394, 28,788, 750,887, 1,501,774, 2,252,661, 3,003,548, 4,505,322, 9,010,64424 in total
Arithmetic
Previous number9,010,643
Next number9,010,645
Double18,021,288
Half4,505,322
Square81,191,705,294,736
Cube731,589,552,163,781,169,984
Square root3,001.773475797≈irrational, shown to 9 decimal places
Cube root208.090351526≈
Negation-9,010,644
Reciprocal1.10979859 × 10^-7≈
Representations
Decimal9,010,644
Binary10001001011111011101010024 bits
Octal42276724
Hexadecimal897DD4
Base 365D4NO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, ten thousand, six hundred and forty-four
Ordinalnine million, ten thousand, six hundred and forty-fourth
Scientific notation9.010644 × 10^6
Engineering notation9.010644 × 10^6
In other bases
Ternary121221210021120base 3; the most digit-efficient integer base after e: 15 digits
Quinary4301320034base 5; one hand: 10 digits
Septenary136406046base 7: 9 digits
Nonary17853246base 9; each digit is two ternary digits: 8 digits
Duodecimal30265b0base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g66c4base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:42:57:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00TT1010TTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111101000001011010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010010111110111010100
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 even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes389 7d d4
Gray code110011011100001100111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010010111110111010100
64-bit0000000000000000000000000000000000000000100010010111110111010100
One's complement11111111011101101000001000101011at 32 bits, every bit flipped
Bits reversed00101011101111101001000100000000at 32 bits
Rotated left by 100000001000100101111101110101000at 32 bits, wrapping
Shifted left by 11000100101111101110101000= 18,021,288, no wrap
Shifted right by 110001001011111011101010= 4,505,322, discarding the low bit
These bits as a double4.45184965 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,010,644 to the power 281,191,705,294,736
9,010,644 to the power 3731,589,552,163,781,169,984
9,010,644 to the power 46,592,093,008,667,261,816,629,309,696
9,010,644 to the power 559,399,003,315,989,610,684,439,989,636,404,224
First ten multiples9,010,644, 18,021,288, 27,031,932, 36,042,576, 45,053,220, 54,063,864, 63,074,508, 72,085,152, 81,095,796, 90,106,440
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10No, remainder 4
Divisible by 11No, remainder 5
Divisible by 12Yes
Divisible by 100No, remainder 44
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached9,010,644
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,010,644 → 4,505,322 → 2,252,661 → 6,757,984 → 3,378,992 → 1,689,496 → 844,748 → 422,374 → 211,187 → 633,562 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage901,064,400%
9,010,644% as a decimal90,106.44
9,010,644% of 1009,010,644
9,010,644% of 1,00090,106,440
As a fraction of 1009,010,644/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,010,644
Nerdulate something else
Nothing in mind? Surprise me · today’s page