Recognised as Number

1,609,260

Positive
Even
Composite
7 digits

1,609,260 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,609,260

Digit count7

Digit sum24

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 5 × 26,821

Distinct prime factors42, 3, 5, 26,821

Number of divisors24

Sum of divisors σ(n)4,506,096

Aliquot sum2,896,836sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)429,120integers below n that share no factor with it

Carmichael function λ(n)26,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 429,120

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 26,821, 53,642, 80,463, 107,284, 134,105, 160,926, 268,210, 321,852, 402,315, 536,420, 804,630, 1,609,26024 in total

Arithmetic

Previous number1,609,259

Next number1,609,261

Double3,218,520

Half804,630

Square2,589,717,747,600

Cube4,167,529,182,502,776,000

Square root1,268.56611968≈irrational, shown to 9 decimal places

Cube root117.185912334≈

Negation-1,609,260

Reciprocal6.21403627 × 10^-7≈

Representations

Decimal1,609,260

Binary11000100011100010110021 bits

Octal6107054

Hexadecimal188E2C

Base 36YHPO

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

In wordsone million, six hundred and nine thousand, two hundred and sixty

Ordinalone million, six hundred and nine thousand, two hundred and sixtieth

Scientific notation1.60926 × 10^6

Engineering notation1.60926 × 10^6

In other bases

Ternary10000202111020base 3; the most digit-efficient integer base after e: 14 digits

Quinary402444020base 5; one hand: 9 digits

Septenary16451502base 7: 8 digits

Nonary3022436base 9; each digit is two ternary digits: 7 digits

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

Vigesimala1330base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal7:27:1:0base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110001000111000101100

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes318 8e 2c

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

At each machine width

32-bit00000000000110001000111000101100

64-bit0000000000000000000000000000000000000000000110001000111000101100

One's complement11111111111001110111000111010011at 32 bits, every bit flipped

Bits reversed00110100011100010001100000000000at 32 bits

Rotated left by 100000000001100010001110001011000at 32 bits, wrapping

Shifted left by 11100010001110001011000= 3,218,520, no wrap

Shifted right by 111000100011100010110= 804,630, discarding the low bit

These bits as a double7.95080081 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,609,261+1

Previous prime1,609,249−11

Distance to nearest prime1

Nearest square below1,607,824

Nearest square above1,610,361

Powers & multiples

1,609,260 to the power 22,589,717,747,600

1,609,260 to the power 34,167,529,182,502,776,000

1,609,260 to the power 46,706,638,012,234,417,305,760,000

1,609,260 to the power 510,792,724,287,568,358,393,467,337,600,000

First ten multiples1,609,260, 3,218,520, 4,827,780, 6,437,040, 8,046,300, 9,655,560, 11,264,820, 12,874,080, 14,483,340, 16,092,600

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6Yes

Divisible by 7No, remainder 2

Divisible by 8No, remainder 4

Divisible by 9No, remainder 6

Divisible by 10Yes

Divisible by 11No, remainder 4

Divisible by 12Yes

Divisible by 100No, remainder 60

Collatz (3n + 1) trajectory

Steps to reach 1238the total stopping time

Highest value reached13,935,5448× the starting value

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

First steps1,609,260 → 804,630 → 402,315 → 1,206,946 → 603,473 → 1,810,420 → 905,210 → 452,605 → 1,357,816 → 678,908 → …

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

As a percentage & fraction

As a percentage160,926,000%

1,609,260% as a decimal16,092.6

1,609,260% of 1001,609,260

1,609,260% of 1,00016,092,600

As a fraction of 1001,609,260/100

Read another way

As seconds18 days, 15 hours and 1 minute

As bytes1.535 MiB

As a 24-bit colour#188E2C

Keep nerding

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