Recognised as Number

1,389,113

Positive
Odd
Composite
7 digits

1,389,113 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,389,113

Digit count7

Digit sum26

Digit product648

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 293 × 431

Distinct prime factors311, 293, 431

Number of divisors8

Sum of divisors σ(n)1,524,096

Aliquot sum134,983sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)62,780the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,255,600

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 293, 431, 3,223, 4,741, 126,283, 1,389,1138 in total

Arithmetic

Previous number1,389,112

Next number1,389,114

Double2,778,226

Half694,556.5

Square1,929,634,926,769

Cube2,680,480,962,028,865,897

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

Cube root111.578159119≈

Negation-1,389,113

Reciprocal7.1988384 × 10^-7≈

Representations

Decimal1,389,113

Binary10101001100100011100121 bits

Octal5231071

Hexadecimal153239

Base 36TRUH

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

In wordsone million, three hundred and eighty-nine thousand, one hundred and thirteen

Ordinalone million, three hundred and eighty-nine thousand, one hundred and thirteenth

Scientific notation1.389113 × 10^6

Engineering notation1.389113 × 10^6

In other bases

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

Quinary323422423base 5; one hand: 9 digits

Septenary14543615base 7: 8 digits

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

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

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

Sexagesimal6:25:51:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101010011001000111001

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

Bit parityeven10 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 32 39

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

At each machine width

32-bit00000000000101010011001000111001

64-bit0000000000000000000000000000000000000000000101010011001000111001

One's complement11111111111010101100110111000110at 32 bits, every bit flipped

Bits reversed10011100010011001010100000000000at 32 bits

Rotated left by 100000000001010100110010001110010at 32 bits, wrapping

Shifted left by 11010100110010001110010= 2,778,226, no wrap

Shifted right by 110101001100100011100= 694,556, discarding the low bit

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

Nearest landmarks

Next prime1,389,133+20

Previous prime1,389,107−6

Distance to nearest prime6

Nearest square below1,387,684

Nearest square above1,390,041

Powers & multiples

1,389,113 to the power 21,929,634,926,769

1,389,113 to the power 32,680,480,962,028,865,897

1,389,113 to the power 43,723,490,950,606,803,992,779,361

1,389,113 to the power 55,172,349,684,870,269,314,821,716,496,793

First ten multiples1,389,113, 2,778,226, 4,167,339, 5,556,452, 6,945,565, 8,334,678, 9,723,791, 11,112,904, 12,502,017, 13,891,130

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 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached4,688,2603× the starting value

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

First steps1,389,113 → 4,167,340 → 2,083,670 → 1,041,835 → 3,125,506 → 1,562,753 → 4,688,260 → 2,344,130 → 1,172,065 → 3,516,196 → …

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

As a percentage & fraction

As a percentage138,911,300%

1,389,113% as a decimal13,891.13

1,389,113% of 1001,389,113

1,389,113% of 1,00013,891,130

As a fraction of 1001,389,113/100

Read another way

As seconds16 days, 1 hour and 51 minutes

As bytes1.325 MiB

As a 24-bit colour#153239

Keep nerding

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