Recognised as Number
9,816,823
- Positive
- Odd
- Prime
- 7 digits
9,816,823 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,816,823
Digit count7
Digit sum37
Digit product20,736
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,816,823
Distinct prime factors19,816,823
Number of divisors2
Sum of divisors σ(n)9,816,824
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,816,822integers below n that share no factor with it
Carmichael function λ(n)9,816,822the 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,816,8232 in total
Arithmetic
Previous number9,816,822
Next number9,816,824
Double19,633,646
Half4,908,411.5
Square96,370,013,813,329
Cube946,047,368,113,005,833,767
Square root3,133.180971473≈irrational, shown to 9 decimal places
Cube root214.119877808≈
Negation-9,816,823
Reciprocal1.0186595 × 10^-7≈
Representations
Decimal9,816,823
Binary10010101110010101111011124 bits
Octal45345367
Hexadecimal95CAF7
Base 365UEPJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and sixteen thousand, eight hundred and twenty-three
Ordinalnine million, eight hundred and sixteen thousand, eight hundred and twenty-third
Scientific notation9.816823 × 10^6
Engineering notation9.816823 × 10^6
In other bases
Ternary200110202011001base 3; the most digit-efficient integer base after e: 15 digits
Quinary10003114243base 5; one hand: 11 digits
Septenary146304322base 7: 9 digits
Nonary20422131base 9; each digit is two ternary digits: 8 digits
Duodecimal3355047base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal317213base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:26:53:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00111T1T011001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010101101111100001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101011100101011110111
Bit length24 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits9within that length
Bit parityodd15 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
Bytes395 ca f7
Gray code110111110010111110001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101011100101011110111
64-bit0000000000000000000000000000000000000000100101011100101011110111
One's complement11111111011010100011010100001000at 32 bits, every bit flipped
Bits reversed11101111010100111010100100000000at 32 bits
Rotated left by 100000001001010111001010111101110at 32 bits, wrapping
Shifted left by 11001010111001010111101110= 19,633,646, no wrap
Shifted right by 110010101110010101111011= 4,908,411, discarding the low bit
These bits as a double4.850155 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,816,823 to the power 296,370,013,813,329
9,816,823 to the power 3946,047,368,113,005,833,767
9,816,823 to the power 49,287,179,562,381,222,268,058,062,241
9,816,823 to the power 591,170,597,933,113,917,529,184,550,742,880,343
First ten multiples9,816,823, 19,633,646, 29,450,469, 39,267,292, 49,084,115, 58,900,938, 68,717,761, 78,534,584, 88,351,407, 98,168,230
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1194the total stopping time
Highest value reached66,263,5606× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,816,823 → 29,450,470 → 14,725,235 → 44,175,706 → 22,087,853 → 66,263,560 → 33,131,780 → 16,565,890 → 8,282,945 → 24,848,836 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage981,682,300%
9,816,823% as a decimal98,168.23
9,816,823% of 1009,816,823
9,816,823% of 1,00098,168,230
As a fraction of 1009,816,823/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,816,823
Nerdulate something else
Nothing in mind? Surprise me · today’s page