Recognised as Number

1,390,393

Positive
Odd
Composite
7 digits

1,390,393 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,390,393

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation71 × 19,583

Distinct prime factors271, 19,583

Number of divisors4

Sum of divisors σ(n)1,410,048

Aliquot sum19,655sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,370,740integers below n that share no factor with it

Carmichael function λ(n)685,370the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,370,740

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

SquarefreeYesno repeated prime factor

All divisors1, 71, 19,583, 1,390,3934 in total

Arithmetic

Previous number1,390,392

Next number1,390,394

Double2,780,786

Half695,196.5

Square1,933,192,694,449

Cube2,687,897,590,013,028,457

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

Cube root111.612419878≈

Negation-1,390,393

Reciprocal7.19221112 × 10^-7≈

Representations

Decimal1,390,393

Binary10101001101110011100121 bits

Octal5233471

Hexadecimal153739

Base 36TSU1

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

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

Ordinalone million, three hundred and ninety thousand, three hundred and ninety-third

Scientific notation1.390393 × 10^6

Engineering notation1.390393 × 10^6

In other bases

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

Quinary323443033base 5; one hand: 9 digits

Septenary14550424base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101010011011100111001

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes315 37 39

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

At each machine width

32-bit00000000000101010011011100111001

64-bit0000000000000000000000000000000000000000000101010011011100111001

One's complement11111111111010101100100011000110at 32 bits, every bit flipped

Bits reversed10011100111011001010100000000000at 32 bits

Rotated left by 100000000001010100110111001110010at 32 bits, wrapping

Shifted left by 11010100110111001110010= 2,780,786, no wrap

Shifted right by 110101001101110011100= 695,196, discarding the low bit

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

Nearest landmarks

Next prime1,390,399+6

Previous prime1,390,391−2

Distance to nearest prime2

Nearest square below1,390,041

Nearest square above1,392,400

Powers & multiples

1,390,393 to the power 21,933,192,694,449

1,390,393 to the power 32,687,897,590,013,028,457

1,390,393 to the power 43,737,233,993,870,984,675,413,601

1,390,393 to the power 55,196,223,984,440,259,995,802,342,935,193

First ten multiples1,390,393, 2,780,786, 4,171,179, 5,561,572, 6,951,965, 8,342,358, 9,732,751, 11,123,144, 12,513,537, 13,903,930

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 1199the total stopping time

Highest value reached4,692,5803× the starting value

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

First steps1,390,393 → 4,171,180 → 2,085,590 → 1,042,795 → 3,128,386 → 1,564,193 → 4,692,580 → 2,346,290 → 1,173,145 → 3,519,436 → …

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

As a percentage & fraction

As a percentage139,039,300%

1,390,393% as a decimal13,903.93

1,390,393% of 1001,390,393

1,390,393% of 1,00013,903,930

As a fraction of 1001,390,393/100

Read another way

As seconds16 days, 2 hours and 13 minutes

As bytes1.326 MiB

As a 24-bit colour#153739

Keep nerding

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