Recognised as Number

9,065,060

Positive
Even
Composite
7 digits

9,065,060 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value9,065,060

Digit count7

Digit sum26

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 5 × 281 × 1,613

Distinct prime factors42, 5, 281, 1,613

Number of divisors24

Sum of divisors σ(n)19,116,216

Aliquot sum10,051,156sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)112,840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,610,880

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 10, 20, 281, 562, 1,124, 1,405, 1,613, 2,810, 3,226, 5,620, 6,452, 8,065, 16,130, 32,260, 453,253, 906,506, 1,813,012, 2,266,265, 4,532,530, 9,065,06024 in total

Arithmetic

Previous number9,065,059

Next number9,065,061

Double18,130,120

Half4,532,530

Square82,175,312,803,600

Cube744,924,141,083,402,216,000

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

Cube root208.508402531≈

Negation-9,065,060

Reciprocal1.10313666 × 10^-7≈

Representations

Decimal9,065,060

Binary10001010010100100110010024 bits

Octal42451144

Hexadecimal8A5264

Base 365EAN8

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

In wordsnine million, sixty-five thousand and sixty

Ordinalnine million, sixty-five thousand and sixtieth

Scientific notation9.06506 × 10^6

Engineering notation9.06506 × 10^6

In other bases

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

Quinary4310040220base 5; one hand: 10 digits

Septenary140023514base 7: 9 digits

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

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

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

Sexagesimal41:58:4:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100010100101001001100100

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 even

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes38a 52 64

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

At each machine width

32-bit00000000100010100101001001100100

64-bit0000000000000000000000000000000000000000100010100101001001100100

One's complement11111111011101011010110110011011at 32 bits, every bit flipped

Bits reversed00100110010010100101000100000000at 32 bits

Rotated left by 100000001000101001010010011001000at 32 bits, wrapping

Shifted left by 11000101001010010011001000= 18,130,120, no wrap

Shifted right by 110001010010100100110010= 4,532,530, discarding the low bit

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

Nearest landmarks

Next prime9,065,083+23

Previous prime9,065,057−3

Distance to nearest prime3

Nearest square below9,060,100

Nearest square above9,066,121

Powers & multiples

9,065,060 to the power 282,175,312,803,600

9,065,060 to the power 3744,924,141,083,402,216,000

9,065,060 to the power 46,752,782,034,369,506,092,172,960,000

9,065,060 to the power 561,214,374,308,481,634,895,913,412,777,600,000

First ten multiples9,065,060, 18,130,120, 27,195,180, 36,260,240, 45,325,300, 54,390,360, 63,455,420, 72,520,480, 81,585,540, 90,650,600

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 4

Divisible by 8No, remainder 4

Divisible by 9No, remainder 8

Divisible by 10Yes

Divisible by 11No, remainder 4

Divisible by 12No, remainder 8

Divisible by 100No, remainder 60

Collatz (3n + 1) trajectory

Steps to reach 188the total stopping time

Highest value reached9,065,060

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

First steps9,065,060 → 4,532,530 → 2,266,265 → 6,798,796 → 3,399,398 → 1,699,699 → 5,099,098 → 2,549,549 → 7,648,648 → 3,824,324 → …

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

As a percentage & fraction

As a percentage906,506,000%

9,065,060% as a decimal90,650.6

9,065,060% of 1009,065,060

9,065,060% of 1,00090,650,600

As a fraction of 1009,065,060/100

Read another way

As seconds104 days, 22 hours and 4 minutes

As bytes8.645 MiB

As a 24-bit colour#8A5264

Keep nerding

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