Recognised as Number
9,306,004
- Positive
- Even
- Composite
- 7 digits
9,306,004 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value9,306,004
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 17 × 107 × 1,279
Distinct prime factors42, 17, 107, 1,279
Number of divisors24
Sum of divisors σ(n)17,418,240
Aliquot sum8,112,236sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,334,976integers below n that share no factor with it
Carmichael function λ(n)541,872the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,334,976
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 17, 34, 68, 107, 214, 428, 1,279, 1,819, 2,558, 3,638, 5,116, 7,276, 21,743, 43,486, 86,972, 136,853, 273,706, 547,412, 2,326,501, 4,653,002, 9,306,00424 in total
Arithmetic
Previous number9,306,003
Next number9,306,005
Double18,612,008
Half4,653,002
Square86,601,710,448,016
Cube805,915,863,836,078,688,064
Square root3,050.574372147≈irrational, shown to 9 decimal places
Cube root210.339616757≈
Negation-9,306,004
Reciprocal1.07457508 × 10^-7≈
Representations
Decimal9,306,004
Binary10001101111111111001010024 bits
Octal43377624
Hexadecimal8DFF94
Base 365JGK4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, three hundred and six thousand and four
Ordinalnine million, three hundred and six thousand and fourth
Scientific notation9.306004 × 10^6
Engineering notation9.306004 × 10^6
In other bases
Ternary122111210102211base 3; the most digit-efficient integer base after e: 15 digits
Quinary4340243004base 5; one hand: 10 digits
Septenary142046131base 7: 9 digits
Nonary18453384base 9; each digit is two ternary digits: 8 digits
Duodecimal3149504base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2i3504base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:5:0:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00TTTT10110T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100100000000010010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100011011111111110010100
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 even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes38d ff 94
Gray code110010110000000001011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100011011111111110010100
64-bit0000000000000000000000000000000000000000100011011111111110010100
One's complement11111111011100100000000001101011at 32 bits, every bit flipped
Bits reversed00101001111111111011000100000000at 32 bits
Rotated left by 100000001000110111111111100101000at 32 bits, wrapping
Shifted left by 11000110111111111100101000= 18,612,008, no wrap
Shifted right by 110001101111111111001010= 4,653,002, discarding the low bit
These bits as a double4.59777688 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,306,004 to the power 286,601,710,448,016
9,306,004 to the power 3805,915,863,836,078,688,064
9,306,004 to the power 47,499,856,252,522,003,615,438,336,256
9,306,004 to the power 569,793,692,285,394,775,733,283,618,951,681,024
First ten multiples9,306,004, 18,612,008, 27,918,012, 37,224,016, 46,530,020, 55,836,024, 65,142,028, 74,448,032, 83,754,036, 93,060,040
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1163the total stopping time
Highest value reached9,306,004
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,306,004 → 4,653,002 → 2,326,501 → 6,979,504 → 3,489,752 → 1,744,876 → 872,438 → 436,219 → 1,308,658 → 654,329 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage930,600,400%
9,306,004% as a decimal93,060.04
9,306,004% of 1009,306,004
9,306,004% of 1,00093,060,040
As a fraction of 1009,306,004/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,306,004
Nerdulate something else
Nothing in mind? Surprise me · today’s page