Recognised as Number
9,004,361
- Positive
- Odd
- Prime
- 7 digits
9,004,361 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,004,361
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,004,361
Distinct prime factors19,004,361
Number of divisors2
Sum of divisors σ(n)9,004,362
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,004,360integers below n that share no factor with it
Carmichael function λ(n)9,004,360the 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,004,3612 in total
Arithmetic
Previous number9,004,360
Next number9,004,362
Double18,008,722
Half4,502,180.5
Square81,078,517,018,321
Cube730,060,236,577,605,897,881
Square root3,000.726745307≈irrational, shown to 9 decimal places
Cube root208.041974086≈
Negation-9,004,361
Reciprocal1.11057298 × 10^-7≈
Representations
Decimal9,004,361
Binary10001001011001010100100124 bits
Octal42262511
Hexadecimal896549
Base 365CZT5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, four thousand, three hundred and sixty-one
Ordinalnine million, four thousand, three hundred and sixty-first
Scientific notation9.004361 × 10^6
Engineering notation9.004361 × 10^6
In other bases
Ternary121221110122212base 3; the most digit-efficient integer base after e: 15 digits
Quinary4301114421base 5; one hand: 10 digits
Septenary136351532base 7: 9 digits
Nonary17843585base 9; each digit is two ternary digits: 8 digits
Duodecimal3022a35base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g5ai1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:41:12:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0T1111T000TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111101010010101011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010010110010101001001
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 odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes389 65 49
Gray code110011011101011111101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010010110010101001001
64-bit0000000000000000000000000000000000000000100010010110010101001001
One's complement11111111011101101001101010110110at 32 bits, every bit flipped
Bits reversed10010010101001101001000100000000at 32 bits
Rotated left by 100000001000100101100101010010010at 32 bits, wrapping
Shifted left by 11000100101100101010010010= 18,008,722, no wrap
Shifted right by 110001001011001010100100= 4,502,180, discarding the low bit
These bits as a double4.44874543 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,004,361 to the power 281,078,517,018,321
9,004,361 to the power 3730,060,236,577,605,897,881
9,004,361 to the power 46,573,725,921,890,168,020,249,659,041
9,004,361 to the power 559,192,201,315,756,875,204,983,240,132,077,801
First ten multiples9,004,361, 18,008,722, 27,013,083, 36,017,444, 45,021,805, 54,026,166, 63,030,527, 72,034,888, 81,039,249, 90,043,610
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached45,584,5845× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,004,361 → 27,013,084 → 13,506,542 → 6,753,271 → 20,259,814 → 10,129,907 → 30,389,722 → 15,194,861 → 45,584,584 → 22,792,292 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage900,436,100%
9,004,361% as a decimal90,043.61
9,004,361% of 1009,004,361
9,004,361% of 1,00090,043,610
As a fraction of 1009,004,361/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,004,361
Nerdulate something else
Nothing in mind? Surprise me · today’s page