Recognised as Number

9,005,368

Positive
Even
Composite
7 digits

9,005,368 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value9,005,368

Digit count7

Digit sum31

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^3 × 79 × 14,249

Distinct prime factors32, 79, 14,249

Number of divisors16

Sum of divisors σ(n)17,100,000

Aliquot sum8,094,632sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)4,445,376integers below n that share no factor with it

Carmichael function λ(n)42,744the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,445,376

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 79, 158, 316, 632, 14,249, 28,498, 56,996, 113,992, 1,125,671, 2,251,342, 4,502,684, 9,005,36816 in total

Arithmetic

Previous number9,005,367

Next number9,005,369

Double18,010,736

Half4,502,684

Square81,096,652,815,424

Cube730,305,202,171,129,196,032

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

Cube root208.049729234≈

Negation-9,005,368

Reciprocal1.11044879 × 10^-7≈

Representations

Decimal9,005,368

Binary10001001011010010011100024 bits

Octal42264470

Hexadecimal896938

Base 365D0L4

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

In wordsnine million, five thousand, three hundred and sixty-eight

Ordinalnine million, five thousand, three hundred and sixty-eighth

Scientific notation9.005368 × 10^6

Engineering notation9.005368 × 10^6

In other bases

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

Quinary4301132433base 5; one hand: 10 digits

Septenary136354501base 7: 9 digits

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

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

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

Sexagesimal41:41:29:28base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100010010110100100111000

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 even

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes389 69 38

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

At each machine width

32-bit00000000100010010110100100111000

64-bit0000000000000000000000000000000000000000100010010110100100111000

One's complement11111111011101101001011011000111at 32 bits, every bit flipped

Bits reversed00011100100101101001000100000000at 32 bits

Rotated left by 100000001000100101101001001110000at 32 bits, wrapping

Shifted left by 11000100101101001001110000= 18,010,736, no wrap

Shifted right by 110001001011010010011100= 4,502,684, discarding the low bit

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

Nearest landmarks

Next prime9,005,371+3

Previous prime9,005,329−39

Distance to nearest prime3

Nearest square below9,000,000

Nearest square above9,006,001

Powers & multiples

9,005,368 to the power 281,096,652,815,424

9,005,368 to the power 3730,305,202,171,129,196,032

9,005,368 to the power 46,576,667,097,865,417,385,812,299,776

9,005,368 to the power 559,225,307,429,770,098,032,837,738,409,197,568

First ten multiples9,005,368, 18,010,736, 27,016,104, 36,021,472, 45,026,840, 54,032,208, 63,037,576, 72,042,944, 81,048,312, 90,053,680

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 3

Divisible by 6No, remainder 4

Divisible by 7No, remainder 1

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10No, remainder 8

Divisible by 11No, remainder 9

Divisible by 12No, remainder 4

Divisible by 100No, remainder 68

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time

Highest value reached9,005,368

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

First steps9,005,368 → 4,502,684 → 2,251,342 → 1,125,671 → 3,377,014 → 1,688,507 → 5,065,522 → 2,532,761 → 7,598,284 → 3,799,142 → …

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

As a percentage & fraction

As a percentage900,536,800%

9,005,368% as a decimal90,053.68

9,005,368% of 1009,005,368

9,005,368% of 1,00090,053,680

As a fraction of 1009,005,368/100

Read another way

As seconds104 days, 5 hours and 29 minutes

As bytes8.588 MiB

As a 24-bit colour#896938

Keep nerding

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