Recognised as Number

9,049,602

Positive
Even
Composite
7 digits

9,049,602 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value9,049,602

Digit count7

Digit sum30

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 41 × 36,787

Distinct prime factors42, 3, 41, 36,787

Number of divisors16

Sum of divisors σ(n)18,541,152

Aliquot sum9,491,550sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)2,942,880integers below n that share no factor with it

Carmichael function λ(n)735,720the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,942,880

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 41, 82, 123, 246, 36,787, 73,574, 110,361, 220,722, 1,508,267, 3,016,534, 4,524,801, 9,049,60216 in total

Arithmetic

Previous number9,049,601

Next number9,049,603

Double18,099,204

Half4,524,801

Square81,895,296,358,404

Cube741,119,837,715,605,555,208

Square root3,008.255640733≈irrational, shown to 9 decimal places

Cube root208.389816934≈

Negation-9,049,602

Reciprocal1.10502097 × 10^-7≈

Representations

Decimal9,049,602

Binary10001010000101100000001024 bits

Octal42413002

Hexadecimal8A1602

Base 365DYPU

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsnine million, forty-nine thousand, six hundred and two

Ordinalnine million, forty-nine thousand, six hundred and second

Scientific notation9.049602 × 10^6

Engineering notation9.049602 × 10^6

In other bases

Ternary122000202201110base 3; the most digit-efficient integer base after e: 15 digits

Quinary4304041402base 5; one hand: 10 digits

Septenary136630452base 7: 9 digits

Nonary18022643base 9; each digit is two ternary digits: 8 digits

Duodecimal3045056base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal2gb402base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal41:53:46:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T0T001T10T01110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1100111100110101000000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100010100001011000000010

Bit length24 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits17within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being even

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes38a 16 02

Gray code110011110001110100000011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100010100001011000000010

64-bit0000000000000000000000000000000000000000100010100001011000000010

One's complement11111111011101011110100111111101at 32 bits, every bit flipped

Bits reversed01000000011010000101000100000000at 32 bits

Rotated left by 100000001000101000010110000000100at 32 bits, wrapping

Shifted left by 11000101000010110000000100= 18,099,204, no wrap

Shifted right by 110001010000101100000001= 4,524,801, discarding the low bit

These bits as a double4.47109746 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,049,619+17

Previous prime9,049,583−19

Distance to nearest prime17

Nearest square below9,048,064

Nearest square above9,054,081

Powers & multiples

9,049,602 to the power 281,895,296,358,404

9,049,602 to the power 3741,119,837,715,605,555,208

9,049,602 to the power 46,706,839,565,630,819,463,621,427,216

9,049,602 to the power 560,694,228,746,811,795,079,627,394,976,768,032

First ten multiples9,049,602, 18,099,204, 27,148,806, 36,198,408, 45,248,010, 54,297,612, 63,347,214, 72,396,816, 81,446,418, 90,496,020

Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 2

Divisible by 8No, remainder 2

Divisible by 9No, remainder 3

Divisible by 10No, remainder 2

Divisible by 11No, remainder 1

Divisible by 12No, remainder 6

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached13,574,4041× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps9,049,602 → 4,524,801 → 13,574,404 → 6,787,202 → 3,393,601 → 10,180,804 → 5,090,402 → 2,545,201 → 7,635,604 → 3,817,802 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage904,960,200%

9,049,602% as a decimal90,496.02

9,049,602% of 1009,049,602

9,049,602% of 1,00090,496,020

As a fraction of 1009,049,602/100

Read another way

As seconds104 days, 17 hours and 46 minutes

As bytes8.63 MiB

As a 24-bit colour#8A1602

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.