Recognised as Number
9,055,873
- Positive
- Odd
- Prime
- 7 digits
9,055,873 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,055,873
Digit count7
Digit sum37
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,055,873
Distinct prime factors19,055,873
Number of divisors2
Sum of divisors σ(n)9,055,874
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,055,872integers below n that share no factor with it
Carmichael function λ(n)9,055,872the 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,055,8732 in total
Arithmetic
Previous number9,055,872
Next number9,055,874
Double18,111,746
Half4,527,936.5
Square82,008,835,792,129
Cube742,661,601,811,374,623,617
Square root3,009.297758614≈irrational, shown to 9 decimal places
Cube root208.437940995≈
Negation-9,055,873
Reciprocal1.10425577 × 10^-7≈
Representations
Decimal9,055,873
Binary10001010001011101000000124 bits
Octal42427201
Hexadecimal8A2E81
Base 365E3K1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, fifty-five thousand, eight hundred and seventy-three
Ordinalnine million, fifty-five thousand, eight hundred and seventy-third
Scientific notation9.055873 × 10^6
Engineering notation9.055873 × 10^6
In other bases
Ternary122001002022201base 3; the most digit-efficient integer base after e: 15 digits
Quinary4304241443base 5; one hand: 10 digits
Septenary136654651base 7: 9 digits
Nonary18032281base 9; each digit is two ternary digits: 8 digits
Duodecimal3048801base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2gbjddbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:55:31:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00101T100T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111100111001110000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010100010111010000001
Bit length24 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits15within that length
Bit parityodd9 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
Bytes38a 2e 81
Gray code110011110011100111000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010100010111010000001
64-bit0000000000000000000000000000000000000000100010100010111010000001
One's complement11111111011101011101000101111110at 32 bits, every bit flipped
Bits reversed10000001011101000101000100000000at 32 bits
Rotated left by 100000001000101000101110100000010at 32 bits, wrapping
Shifted left by 11000101000101110100000010= 18,111,746, no wrap
Shifted right by 110001010001011101000000= 4,527,936, discarding the low bit
These bits as a double4.47419574 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,055,873 to the power 282,008,835,792,129
9,055,873 to the power 3742,661,601,811,374,623,617
9,055,873 to the power 46,725,449,147,980,378,546,898,352,641
9,055,873 to the power 560,904,813,352,068,514,612,636,025,426,110,593
First ten multiples9,055,873, 18,111,746, 27,167,619, 36,223,492, 45,279,365, 54,335,238, 63,391,111, 72,446,984, 81,502,857, 90,558,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1256the total stopping time
Highest value reached65,275,9367× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,055,873 → 27,167,620 → 13,583,810 → 6,791,905 → 20,375,716 → 10,187,858 → 5,093,929 → 15,281,788 → 7,640,894 → 3,820,447 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage905,587,300%
9,055,873% as a decimal90,558.73
9,055,873% of 1009,055,873
9,055,873% of 1,00090,558,730
As a fraction of 1009,055,873/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,055,873
Nerdulate something else
Nothing in mind? Surprise me · today’s page