Recognised as Number
9,967,823
- Positive
- Odd
- Prime
- 7 digits
9,967,823 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,967,823
Digit count7
Digit sum44
Digit product163,296
Multiplicative persistence5times 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 factorisation9,967,823
Distinct prime factors19,967,823
Number of divisors2
Sum of divisors σ(n)9,967,824
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,967,822integers below n that share no factor with it
Carmichael function λ(n)9,967,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,967,8232 in total
Arithmetic
Previous number9,967,822
Next number9,967,824
Double19,935,646
Half4,983,911.5
Square99,357,495,359,329
Cube990,377,927,465,112,870,767
Square root3,157.18593054≈irrational, shown to 9 decimal places
Cube root215.21214323≈
Negation-9,967,823
Reciprocal1.00322809 × 10^-7≈
Representations
Decimal9,967,823
Binary10011000000110001100111124 bits
Octal46014317
Hexadecimal9818CF
Base 365XN7Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, nine hundred and sixty-seven thousand, eight hundred and twenty-three
Ordinalnine million, nine hundred and sixty-seven thousand, eight hundred and twenty-third
Scientific notation9.967823 × 10^6
Engineering notation9.967823 × 10^6
In other bases
Ternary200202102021122base 3; the most digit-efficient integer base after e: 15 digits
Quinary10022432243base 5; one hand: 11 digits
Septenary150503465base 7: 9 digits
Nonary20672248base 9; each digit is two ternary digits: 8 digits
Duodecimal34084bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal325jb3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:8:50:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1T11T10TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010000110100111010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100110000001100011001111
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 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
Bytes398 18 cf
Gray code110101000001010010101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100110000001100011001111
64-bit0000000000000000000000000000000000000000100110000001100011001111
One's complement11111111011001111110011100110000at 32 bits, every bit flipped
Bits reversed11110011000110000001100100000000at 32 bits
Rotated left by 100000001001100000011000110011110at 32 bits, wrapping
Shifted left by 11001100000011000110011110= 19,935,646, no wrap
Shifted right by 110011000000110001100111= 4,983,911, discarding the low bit
These bits as a double4.92475891 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,967,823 to the power 299,357,495,359,329
9,967,823 to the power 3990,377,927,465,112,870,767
9,967,823 to the power 49,871,911,884,079,083,770,827,330,241
9,967,823 to the power 598,401,470,332,096,825,029,779,391,404,835,343
First ten multiples9,967,823, 19,935,646, 29,903,469, 39,871,292, 49,839,115, 59,806,938, 69,774,761, 79,742,584, 89,710,407, 99,678,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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1282the total stopping time
Highest value reached29,864,702,7522,996× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,967,823 → 29,903,470 → 14,951,735 → 44,855,206 → 22,427,603 → 67,282,810 → 33,641,405 → 100,924,216 → 50,462,108 → 25,231,054 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage996,782,300%
9,967,823% as a decimal99,678.23
9,967,823% of 1009,967,823
9,967,823% of 1,00099,678,230
As a fraction of 1009,967,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,967,823
Nerdulate something else
Nothing in mind? Surprise me · today’s page