Recognised as Number

1,062,272

Positive
Even
Composite
7 digits

1,062,272 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,062,272

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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^7 × 43 × 193

Distinct prime factors32, 43, 193

Number of divisors32

Sum of divisors σ(n)2,176,680

Aliquot sum1,114,408sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)1,344the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 516,096

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 32, 43, 64, 86, 128, 172, 193, 344, 386, 688, 772, 1,376, 1,544, 2,752, 3,088, 5,504, 6,176, 8,299, 12,352, 16,598, 24,704, 33,196, 66,392, 132,784, 265,568, 531,136, 1,062,27232 in total

Arithmetic

Previous number1,062,271

Next number1,062,273

Double2,124,544

Half531,136

Square1,128,421,801,984

Cube1,198,690,884,437,147,648

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

Cube root102.034078066≈

Negation-1,062,272

Reciprocal9.41378479 × 10^-7≈

Representations

Decimal1,062,272

Binary10000001101011000000021 bits

Octal4032600

Hexadecimal103580

Base 36MRNK

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

In wordsone million, sixty-two thousand, two hundred and seventy-two

Ordinalone million, sixty-two thousand, two hundred and seventy-second

Scientific notation1.062272 × 10^6

Engineering notation1.062272 × 10^6

In other bases

Ternary1222222011102base 3; the most digit-efficient integer base after e: 13 digits

Quinary232443042base 5; one hand: 9 digits

Septenary12013001base 7: 8 digits

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

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

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

Sexagesimal4:55:4:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100000011010110000000

Bit length21 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits15within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 77 trailing zeros

Power of twoNo

Bytes310 35 80

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

At each machine width

32-bit00000000000100000011010110000000

64-bit0000000000000000000000000000000000000000000100000011010110000000

One's complement11111111111011111100101001111111at 32 bits, every bit flipped

Bits reversed00000001101011000000100000000000at 32 bits

Rotated left by 100000000001000000110101100000000at 32 bits, wrapping

Shifted left by 11000000110101100000000= 2,124,544, no wrap

Shifted right by 110000001101011000000= 531,136, discarding the low bit

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

Nearest landmarks

Next prime1,062,293+21

Previous prime1,062,263−9

Distance to nearest prime9

Nearest square below1,060,900

Nearest square above1,062,961

Powers & multiples

1,062,272 to the power 21,128,421,801,984

1,062,272 to the power 31,198,690,884,437,147,648

1,062,272 to the power 41,273,335,763,192,817,706,336,256

1,062,272 to the power 51,352,628,927,838,360,850,545,227,333,632

First ten multiples1,062,272, 2,124,544, 3,186,816, 4,249,088, 5,311,360, 6,373,632, 7,435,904, 8,498,176, 9,560,448, 10,622,720

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

Divisible by 6No, remainder 2

Divisible by 7No, remainder 1

Divisible by 8Yes

Divisible by 9No, remainder 2

Divisible by 10No, remainder 2

Divisible by 11No, remainder 2

Divisible by 12No, remainder 8

Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 1165the total stopping time

Highest value reached1,062,272

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

First steps1,062,272 → 531,136 → 265,568 → 132,784 → 66,392 → 33,196 → 16,598 → 8,299 → 24,898 → 12,449 → …

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

As a percentage & fraction

As a percentage106,227,200%

1,062,272% as a decimal10,622.72

1,062,272% of 1001,062,272

1,062,272% of 1,00010,622,720

As a fraction of 1001,062,272/100

Read another way

As seconds12 days, 7 hours and 4 minutes

As bytes1.013 MiB

As a 24-bit colour#103580

Keep nerding

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