Recognised as Number
9,821,312
- Positive
- Even
- Composite
- 7 digits
9,821,312 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value9,821,312
Digit count7
Digit sum26
Digit product864
Multiplicative persistence4times 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 factorisation2^7 × 277^2
Distinct prime factors22, 277
Number of divisors24
Sum of divisors σ(n)19,636,785
Aliquot sum9,815,473sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,892,928integers below n that share no factor with it
Carmichael function λ(n)611,616the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,892,928
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 277, 554, 1,108, 2,216, 4,432, 8,864, 17,728, 35,456, 76,729, 153,458, 306,916, 613,832, 1,227,664, 2,455,328, 4,910,656, 9,821,31224 in total
Arithmetic
Previous number9,821,311
Next number9,821,313
Double19,642,624
Half4,910,656
Square96,458,169,401,344
Cube947,345,776,639,452,643,328
Square root3,133.897254219≈irrational, shown to 9 decimal places
Cube root214.152510146≈
Negation-9,821,312
Reciprocal1.0181939 × 10^-7≈
Representations
Decimal9,821,312
Binary10010101110111001000000024 bits
Octal45356200
Hexadecimal95DC80
Base 365UI68
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and twenty-one thousand, three hundred and twelve
Ordinalnine million, eight hundred and twenty-one thousand, three hundred and twelfth
Scientific notation9.821312 × 10^6
Engineering notation9.821312 × 10^6
In other bases
Ternary200110222022022base 3; the most digit-efficient integer base after e: 15 digits
Quinary10003240222base 5; one hand: 11 digits
Septenary146323364base 7: 9 digits
Nonary20428268base 9; each digit is two ternary digits: 8 digits
Duodecimal3357768base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal317d5cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:28:8:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0011100T10T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010100010110110000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101011101110010000000
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 even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 77 trailing zeros
Power of twoNo
Bytes395 dc 80
Gray code110111110011001011000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101011101110010000000
64-bit0000000000000000000000000000000000000000100101011101110010000000
One's complement11111111011010100010001101111111at 32 bits, every bit flipped
Bits reversed00000001001110111010100100000000at 32 bits
Rotated left by 100000001001010111011100100000000at 32 bits, wrapping
Shifted left by 11001010111011100100000000= 19,642,624, no wrap
Shifted right by 110010101110111001000000= 4,910,656, discarding the low bit
These bits as a double4.85237286 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,821,312 to the power 296,458,169,401,344
9,821,312 to the power 3947,345,776,639,452,643,328
9,821,312 to the power 49,304,178,444,258,375,919,349,006,336
9,821,312 to the power 591,379,239,404,736,118,517,213,428,115,832,832
First ten multiples9,821,312, 19,642,624, 29,463,936, 39,285,248, 49,106,560, 58,927,872, 68,749,184, 78,570,496, 88,391,808, 98,213,120
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 8
Divisible by 100No, remainder 12
Collatz (3n + 1) trajectory
Steps to reach 170the total stopping time
Highest value reached9,821,312
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,821,312 → 4,910,656 → 2,455,328 → 1,227,664 → 613,832 → 306,916 → 153,458 → 76,729 → 230,188 → 115,094 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage982,131,200%
9,821,312% as a decimal98,213.12
9,821,312% of 1009,821,312
9,821,312% of 1,00098,213,120
As a fraction of 1009,821,312/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,821,312
Nerdulate something else
Nothing in mind? Surprise me · today’s page