Recognised as Number

1,390,002

Positive
Even
Composite
7 digits

1,390,002 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,390,002

Digit count7

Digit sum15

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 19 × 89 × 137

Distinct prime factors52, 3, 19, 89, 137

Number of divisors32

Sum of divisors σ(n)2,980,800

Aliquot sum1,590,798sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)13,464the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 430,848

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 19, 38, 57, 89, 114, 137, 178, 267, 274, 411, 534, 822, 1,691, 2,603, 3,382, 5,073, 5,206, 7,809, 10,146, 12,193, 15,618, 24,386, 36,579, 73,158, 231,667, 463,334, 695,001, 1,390,00232 in total

Arithmetic

Previous number1,390,001

Next number1,390,003

Double2,780,004

Half695,001

Square1,932,105,560,004

Cube2,685,630,592,616,680,008

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

Cube root111.601956518≈

Negation-1,390,002

Reciprocal7.19423425 × 10^-7≈

Representations

Decimal1,390,002

Binary10101001101011011001021 bits

Octal5232662

Hexadecimal1535B2

Base 36TSJ6

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

In wordsone million, three hundred and ninety thousand and two

Ordinalone million, three hundred and ninety thousand and second

Scientific notation1.390002 × 10^6

Engineering notation1.390002 × 10^6

In other bases

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

Quinary323440002base 5; one hand: 9 digits

Septenary14546325base 7: 8 digits

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

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

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

Sexagesimal6:26:6:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101010011010110110010

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

Bit parityodd11 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

Bytes315 35 b2

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

At each machine width

32-bit00000000000101010011010110110010

64-bit0000000000000000000000000000000000000000000101010011010110110010

One's complement11111111111010101100101001001101at 32 bits, every bit flipped

Bits reversed01001101101011001010100000000000at 32 bits

Rotated left by 100000000001010100110101101100100at 32 bits, wrapping

Shifted left by 11010100110101101100100= 2,780,004, no wrap

Shifted right by 110101001101011011001= 695,001, discarding the low bit

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

Nearest landmarks

Next prime1,390,003+1

Previous prime1,389,991−11

Distance to nearest prime1

Nearest square below1,387,684

Nearest square above1,390,041

Powers & multiples

1,390,002 to the power 21,932,105,560,004

1,390,002 to the power 32,685,630,592,616,680,008

1,390,002 to the power 43,733,031,894,998,370,444,480,016

1,390,002 to the power 55,188,921,800,111,524,914,568,111,200,032

First ten multiples1,390,002, 2,780,004, 4,170,006, 5,560,008, 6,950,010, 8,340,012, 9,730,014, 11,120,016, 12,510,018, 13,900,020

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 5

Divisible by 8No, remainder 2

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 9

Divisible by 12No, remainder 6

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 1168the total stopping time

Highest value reached2,345,6321× the starting value

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

First steps1,390,002 → 695,001 → 2,085,004 → 1,042,502 → 521,251 → 1,563,754 → 781,877 → 2,345,632 → 1,172,816 → 586,408 → …

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

As a percentage & fraction

As a percentage139,000,200%

1,390,002% as a decimal13,900.02

1,390,002% of 1001,390,002

1,390,002% of 1,00013,900,020

As a fraction of 1001,390,002/100

Read another way

As seconds16 days, 2 hours and 6 minutes

As bytes1.326 MiB

As a 24-bit colour#1535B2

Keep nerding

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