Recognised as Number

1,662,352

Positive
Even
Composite
7 digits

1,662,352 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,662,352

Digit count7

Digit sum25

Digit product2,160

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 107 × 971

Distinct prime factors32, 107, 971

Number of divisors20

Sum of divisors σ(n)3,254,256

Aliquot sum1,591,904sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 107, 214, 428, 856, 971, 1,712, 1,942, 3,884, 7,768, 15,536, 103,897, 207,794, 415,588, 831,176, 1,662,35220 in total

Arithmetic

Previous number1,662,351

Next number1,662,353

Double3,324,704

Half831,176

Square2,763,414,171,904

Cube4,593,767,075,492,958,208

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

Cube root118.460709674≈

Negation-1,662,352

Reciprocal6.01557312 × 10^-7≈

Representations

Decimal1,662,352

Binary11001010111011001000021 bits

Octal6256620

Hexadecimal195D90

Base 36ZMOG

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

In wordsone million, six hundred and sixty-two thousand, three hundred and fifty-two

Ordinalone million, six hundred and sixty-two thousand, three hundred and fifty-second

Scientific notation1.662352 × 10^6

Engineering notation1.662352 × 10^6

In other bases

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

Quinary411143402base 5; one hand: 9 digits

Septenary20062336base 7: 8 digits

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

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

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

Sexagesimal7:41:45:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110010101110110010000

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes319 5d 90

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

At each machine width

32-bit00000000000110010101110110010000

64-bit0000000000000000000000000000000000000000000110010101110110010000

One's complement11111111111001101010001001101111at 32 bits, every bit flipped

Bits reversed00001001101110101001100000000000at 32 bits

Rotated left by 100000000001100101011101100100000at 32 bits, wrapping

Shifted left by 11100101011101100100000= 3,324,704, no wrap

Shifted right by 111001010111011001000= 831,176, discarding the low bit

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

Nearest landmarks

Next prime1,662,361+9

Previous prime1,662,347−5

Distance to nearest prime5

Nearest square below1,661,521

Nearest square above1,664,100

Powers & multiples

1,662,352 to the power 22,763,414,171,904

1,662,352 to the power 34,593,767,075,492,958,208

1,662,352 to the power 47,636,457,885,479,870,062,985,216

1,662,352 to the power 512,694,481,038,843,232,958,943,599,788,032

First ten multiples1,662,352, 3,324,704, 4,987,056, 6,649,408, 8,311,760, 9,974,112, 11,636,464, 13,298,816, 14,961,168, 16,623,520

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 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 6

Divisible by 8Yes

Divisible by 9No, remainder 7

Divisible by 10No, remainder 2

Divisible by 11No, remainder 10

Divisible by 12No, remainder 4

Divisible by 100No, remainder 52

Collatz (3n + 1) trajectory

Steps to reach 1207the total stopping time

Highest value reached1,662,352

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

First steps1,662,352 → 831,176 → 415,588 → 207,794 → 103,897 → 311,692 → 155,846 → 77,923 → 233,770 → 116,885 → …

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

As a percentage & fraction

As a percentage166,235,200%

1,662,352% as a decimal16,623.52

1,662,352% of 1001,662,352

1,662,352% of 1,00016,623,520

As a fraction of 1001,662,352/100

Read another way

As seconds19 days, 5 hours and 45 minutes

As bytes1.585 MiB

As a 24-bit colour#195D90

Keep nerding

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