Recognised as Number

1,362,062

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,362,062

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 × 13 × 52,387

Distinct prime factors32, 13, 52,387

Number of divisors8

Sum of divisors σ(n)2,200,296

Aliquot sum838,234sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)104,772the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 628,632

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 13, 26, 52,387, 104,774, 681,031, 1,362,0628 in total

Arithmetic

Previous number1,362,061

Next number1,362,063

Double2,724,124

Half681,031

Square1,855,212,891,844

Cube2,526,914,981,890,822,328

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

Cube root110.849130857≈

Negation-1,362,062

Reciprocal7.3418097 × 10^-7≈

Representations

Decimal1,362,062

Binary10100110010001000111021 bits

Octal5144216

Hexadecimal14C88E

Base 36T6Z2

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

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

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

Scientific notation1.362062 × 10^6

Engineering notation1.362062 × 10^6

In other bases

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

Quinary322041222base 5; one hand: 9 digits

Septenary14402012base 7: 8 digits

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

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

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

Sexagesimal6:18:21:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101001100100010001110

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

Bytes314 c8 8e

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

At each machine width

32-bit00000000000101001100100010001110

64-bit0000000000000000000000000000000000000000000101001100100010001110

One's complement11111111111010110011011101110001at 32 bits, every bit flipped

Bits reversed01110001000100110010100000000000at 32 bits

Rotated left by 100000000001010011001000100011100at 32 bits, wrapping

Shifted left by 11010011001000100011100= 2,724,124, no wrap

Shifted right by 110100110010001000111= 681,031, discarding the low bit

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

Nearest landmarks

Next prime1,362,071+9

Previous prime1,362,059−3

Distance to nearest prime3

Nearest square below1,361,889

Nearest square above1,364,224

Powers & multiples

1,362,062 to the power 21,855,212,891,844

1,362,062 to the power 32,526,914,981,890,822,328

1,362,062 to the power 43,441,814,874,064,177,241,720,336

1,362,062 to the power 54,687,965,250,997,601,382,212,084,292,832

First ten multiples1,362,062, 2,724,124, 4,086,186, 5,448,248, 6,810,310, 8,172,372, 9,534,434, 10,896,496, 12,258,558, 13,620,620

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

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8No, remainder 6

Divisible by 9No, remainder 2

Divisible by 10No, remainder 2

Divisible by 11No, remainder 9

Divisible by 12No, remainder 2

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 167the total stopping time

Highest value reached4,908,9763× the starting value

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

First steps1,362,062 → 681,031 → 2,043,094 → 1,021,547 → 3,064,642 → 1,532,321 → 4,596,964 → 2,298,482 → 1,149,241 → 3,447,724 → …

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

As a percentage & fraction

As a percentage136,206,200%

1,362,062% as a decimal13,620.62

1,362,062% of 1001,362,062

1,362,062% of 1,00013,620,620

As a fraction of 1001,362,062/100

Read another way

As seconds15 days, 18 hours and 21 minutes

As bytes1.299 MiB

As a 24-bit colour#14C88E

Keep nerding

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