Recognised as Number

1,650,080

Positive
Even
Composite
7 digits

1,650,080 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,650,080

Digit count7

Digit sum20

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^5 × 5 × 10,313

Distinct prime factors32, 5, 10,313

Number of divisors24

Sum of divisors σ(n)3,898,692

Aliquot sum2,248,612sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)10,312the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 659,968

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160, 10,313, 20,626, 41,252, 51,565, 82,504, 103,130, 165,008, 206,260, 330,016, 412,520, 825,040, 1,650,08024 in total

Arithmetic

Previous number1,650,079

Next number1,650,081

Double3,300,160

Half825,040

Square2,722,764,006,400

Cube4,492,778,431,680,512,000

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

Cube root118.168484779≈

Negation-1,650,080

Reciprocal6.06031223 × 10^-7≈

Representations

Decimal1,650,080

Binary11001001011011010000021 bits

Octal6226640

Hexadecimal192DA0

Base 36ZD7K

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

In wordsone million, six hundred and fifty thousand and eighty

Ordinalone million, six hundred and fifty thousand and eightieth

Scientific notation1.65008 × 10^6

Engineering notation1.65008 × 10^6

In other bases

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

Quinary410300310base 5; one hand: 9 digits

Septenary20011505base 7: 8 digits

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

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

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

Sexagesimal7:38:21:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110010010110110100000

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 55 trailing zeros

Power of twoNo

Bytes319 2d a0

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

At each machine width

32-bit00000000000110010010110110100000

64-bit0000000000000000000000000000000000000000000110010010110110100000

One's complement11111111111001101101001001011111at 32 bits, every bit flipped

Bits reversed00000101101101001001100000000000at 32 bits

Rotated left by 100000000001100100101101101000000at 32 bits, wrapping

Shifted left by 11100100101101101000000= 3,300,160, no wrap

Shifted right by 111001001011011010000= 825,040, discarding the low bit

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

Nearest landmarks

Next prime1,650,083+3

Previous prime1,650,079−1

Distance to nearest prime1

Nearest square below1,648,656

Nearest square above1,651,225

Powers & multiples

1,650,080 to the power 22,722,764,006,400

1,650,080 to the power 34,492,778,431,680,512,000

1,650,080 to the power 47,413,443,834,547,379,240,960,000

1,650,080 to the power 512,232,775,402,509,939,537,923,276,800,000

First ten multiples1,650,080, 3,300,160, 4,950,240, 6,600,320, 8,250,400, 9,900,480, 11,550,560, 13,200,640, 14,850,720, 16,500,800

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

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 5

Divisible by 8Yes

Divisible by 9No, remainder 2

Divisible by 10Yes

Divisible by 11No, remainder 3

Divisible by 12No, remainder 8

Divisible by 100No, remainder 80

Collatz (3n + 1) trajectory

Steps to reach 1176the total stopping time

Highest value reached1,650,080

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

First steps1,650,080 → 825,040 → 412,520 → 206,260 → 103,130 → 51,565 → 154,696 → 77,348 → 38,674 → 19,337 → …

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

As a percentage & fraction

As a percentage165,008,000%

1,650,080% as a decimal16,500.8

1,650,080% of 1001,650,080

1,650,080% of 1,00016,500,800

As a fraction of 1001,650,080/100

Read another way

As seconds19 days, 2 hours and 21 minutes

As bytes1.574 MiB

As a 24-bit colour#192DA0

Keep nerding

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