Recognised as Number

1,403,392

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,403,392

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^9 × 2,741

Distinct prime factors22, 2,741

Number of divisors20

Sum of divisors σ(n)2,805,066

Aliquot sum1,401,674sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)87,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 701,440

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2,741, 5,482, 10,964, 21,928, 43,856, 87,712, 175,424, 350,848, 701,696, 1,403,39220 in total

Arithmetic

Previous number1,403,391

Next number1,403,393

Double2,806,784

Half701,696

Square1,969,509,105,664

Cube2,763,993,322,816,012,288

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

Cube root111.95916879≈

Negation-1,403,392

Reciprocal7.12559285 × 10^-7≈

Representations

Decimal1,403,392

Binary10101011010100000000021 bits

Octal5265000

Hexadecimal156A00

Base 36U2V4

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

In wordsone million, four hundred and three thousand, three hundred and ninety-two

Ordinalone million, four hundred and three thousand, three hundred and ninety-second

Scientific notation1.403392 × 10^6

Engineering notation1.403392 × 10^6

In other bases

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

Quinary324402032base 5; one hand: 9 digits

Septenary14633344base 7: 8 digits

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

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

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

Sexagesimal6:29:49:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101010110101000000000

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 99 trailing zeros

Power of twoNo

Bytes315 6a 00

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

At each machine width

32-bit00000000000101010110101000000000

64-bit0000000000000000000000000000000000000000000101010110101000000000

One's complement11111111111010101001010111111111at 32 bits, every bit flipped

Bits reversed00000000010101101010100000000000at 32 bits

Rotated left by 100000000001010101101010000000000at 32 bits, wrapping

Shifted left by 11010101101010000000000= 2,806,784, no wrap

Shifted right by 110101011010100000000= 701,696, discarding the low bit

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

Nearest landmarks

Next prime1,403,393+1

Previous prime1,403,383−9

Distance to nearest prime1

Nearest square below1,401,856

Nearest square above1,404,225

Powers & multiples

1,403,392 to the power 21,969,509,105,664

1,403,392 to the power 32,763,993,322,816,012,288

1,403,392 to the power 43,878,966,117,293,409,116,880,896

1,403,392 to the power 55,443,710,017,280,632,007,357,714,399,232

First ten multiples1,403,392, 2,806,784, 4,210,176, 5,613,568, 7,016,960, 8,420,352, 9,823,744, 11,227,136, 12,630,528, 14,033,920

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 4

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10No, remainder 2

Divisible by 11No, remainder 1

Divisible by 12No, remainder 4

Divisible by 100No, remainder 92

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached1,403,392

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

First steps1,403,392 → 701,696 → 350,848 → 175,424 → 87,712 → 43,856 → 21,928 → 10,964 → 5,482 → 2,741 → …

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

As a percentage & fraction

As a percentage140,339,200%

1,403,392% as a decimal14,033.92

1,403,392% of 1001,403,392

1,403,392% of 1,00014,033,920

As a fraction of 1001,403,392/100

Read another way

As seconds16 days, 5 hours and 49 minutes

As bytes1.338 MiB

As a 24-bit colour#156A00

Keep nerding

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