Recognised as Number

1,661,062

Positive
Even
Composite
7 digits

1,661,062 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,661,062

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 13 × 29 × 2,203

Distinct prime factors42, 13, 29, 2,203

Number of divisors16

Sum of divisors σ(n)2,777,040

Aliquot sum1,115,978sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)30,828the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 739,872

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 13, 26, 29, 58, 377, 754, 2,203, 4,406, 28,639, 57,278, 63,887, 127,774, 830,531, 1,661,06216 in total

Arithmetic

Previous number1,661,061

Next number1,661,063

Double3,322,124

Half830,531

Square2,759,126,967,844

Cube4,583,080,959,460,890,328

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

Cube root118.430059555≈

Negation-1,661,062

Reciprocal6.02024488 × 10^-7≈

Representations

Decimal1,661,062

Binary11001010110001000011021 bits

Octal6254206

Hexadecimal195886

Base 36ZLOM

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

In wordsone million, six hundred and sixty-one thousand and sixty-two

Ordinalone million, six hundred and sixty-one thousand and sixty-second

Scientific notation1.661062 × 10^6

Engineering notation1.661062 × 10^6

In other bases

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

Quinary411123222base 5; one hand: 9 digits

Septenary20055514base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000110010101100010000110

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 11 trailing zero

Power of twoNo

Bytes319 58 86

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

At each machine width

32-bit00000000000110010101100010000110

64-bit0000000000000000000000000000000000000000000110010101100010000110

One's complement11111111111001101010011101111001at 32 bits, every bit flipped

Bits reversed01100001000110101001100000000000at 32 bits

Rotated left by 100000000001100101011000100001100at 32 bits, wrapping

Shifted left by 11100101011000100001100= 3,322,124, no wrap

Shifted right by 111001010110001000011= 830,531, discarding the low bit

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

Nearest landmarks

Next prime1,661,063+1

Previous prime1,661,059−3

Distance to nearest prime1

Nearest square below1,658,944

Nearest square above1,661,521

Powers & multiples

1,661,062 to the power 22,759,126,967,844

1,661,062 to the power 34,583,080,959,460,890,328

1,661,062 to the power 47,612,781,624,684,025,410,008,336

1,661,062 to the power 512,645,302,271,060,896,615,599,266,612,832

First ten multiples1,661,062, 3,322,124, 4,983,186, 6,644,248, 8,305,310, 9,966,372, 11,627,434, 13,288,496, 14,949,558, 16,610,620

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

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 6

Divisible by 9No, remainder 4

Divisible by 10No, remainder 2

Divisible by 11No, remainder 7

Divisible by 12No, remainder 10

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 1176the total stopping time

Highest value reached3,737,3922× the starting value

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

First steps1,661,062 → 830,531 → 2,491,594 → 1,245,797 → 3,737,392 → 1,868,696 → 934,348 → 467,174 → 233,587 → 700,762 → …

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

As a percentage & fraction

As a percentage166,106,200%

1,661,062% as a decimal16,610.62

1,661,062% of 1001,661,062

1,661,062% of 1,00016,610,620

As a fraction of 1001,661,062/100

Read another way

As seconds19 days, 5 hours and 24 minutes

As bytes1.584 MiB

As a 24-bit colour#195886

Keep nerding

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