Recognised as Number

1,612,900

Positive
Even
Composite
Perfect square
7 digits

1,612,900 is an even 7-digit integer and a composite number. It has 27 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,612,900

Digit count7

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,270²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 5^2 × 127^2

Distinct prime factors32, 5, 127

Number of divisors27

Sum of divisors σ(n)3,527,769

Aliquot sum1,914,869sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)160,020the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 640,080

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 10, 20, 25, 50, 100, 127, 254, 508, 635, 1,270, 2,540, 3,175, 6,350, 12,700, 16,129, 32,258, 64,516, 80,645, 161,290, 322,580, 403,225, 806,450, 1,612,90027 in total

Arithmetic

Previous number1,612,899

Next number1,612,901

Double3,225,800

Half806,450

Square2,601,446,410,000

Cube4,195,872,914,689,000,000

Square root1,270exact

Cube root117.274200432≈

Negation-1,612,900

Reciprocal6.2000124 × 10^-7≈

Representations

Decimal1,612,900

Binary11000100111000110010021 bits

Octal6116144

Hexadecimal189C64

Base 36YKIS

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

In wordsone million, six hundred and twelve thousand, nine hundred

Ordinalone million, six hundred and twelve thousand, nine hundredth

Scientific notation1.6129 × 10^6

Engineering notation1.6129 × 10^6

In other bases

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

Quinary403103100base 5; one hand: 9 digits

Septenary16465222base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000110001001110001100100

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 9c 64

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

At each machine width

32-bit00000000000110001001110001100100

64-bit0000000000000000000000000000000000000000000110001001110001100100

One's complement11111111111001110110001110011011at 32 bits, every bit flipped

Bits reversed00100110001110010001100000000000at 32 bits

Rotated left by 100000000001100010011100011001000at 32 bits, wrapping

Shifted left by 11100010011100011001000= 3,225,800, no wrap

Shifted right by 111000100111000110010= 806,450, discarding the low bit

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

Nearest landmarks

Next prime1,612,903+3

Previous prime1,612,859−41

Distance to nearest prime3

Nearest square below1,612,900

Nearest square above1,615,441

Powers & multiples

1,612,900 to the power 22,601,446,410,000

1,612,900 to the power 34,195,872,914,689,000,000

1,612,900 to the power 46,767,523,424,101,888,100,000,000

1,612,900 to the power 510,915,338,530,733,935,316,490,000,000,000

First ten multiples1,612,900, 3,225,800, 4,838,700, 6,451,600, 8,064,500, 9,677,400, 11,290,300, 12,903,200, 14,516,100, 16,129,000

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10Yes

Divisible by 11No, remainder 3

Divisible by 12No, remainder 4

Divisible by 100Yes

Collatz (3n + 1) trajectory

Steps to reach 1194the total stopping time

Highest value reached5,813,0443× the starting value

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

First steps1,612,900 → 806,450 → 403,225 → 1,209,676 → 604,838 → 302,419 → 907,258 → 453,629 → 1,360,888 → 680,444 → …

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

As a percentage & fraction

As a percentage161,290,000%

1,612,900% as a decimal16,129

1,612,900% of 1001,612,900

1,612,900% of 1,00016,129,000

As a fraction of 1001,612,900/100

Read another way

As seconds18 days, 16 hours and 1 minute

As bytes1.538 MiB

As a 24-bit colour#189C64

Keep nerding

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