Recognised as Number

1,383,770

Positive
Even
Composite
7 digits

1,383,770 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,383,770

Digit count7

Digit sum29

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 × 5 × 19 × 7,283

Distinct prime factors42, 5, 19, 7,283

Number of divisors16

Sum of divisors σ(n)2,622,240

Aliquot sum1,238,470sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)131,076the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 524,304

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 19, 38, 95, 190, 7,283, 14,566, 36,415, 72,830, 138,377, 276,754, 691,885, 1,383,77016 in total

Arithmetic

Previous number1,383,769

Next number1,383,771

Double2,767,540

Half691,885

Square1,914,819,412,900

Cube2,649,669,658,988,633,000

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

Cube root111.434919491≈

Negation-1,383,770

Reciprocal7.22663448 × 10^-7≈

Representations

Decimal1,383,770

Binary10101000111010101101021 bits

Octal5216532

Hexadecimal151D5A

Base 36TNQ2

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

In wordsone million, three hundred and eighty-three thousand, seven hundred and seventy

Ordinalone million, three hundred and eighty-three thousand, seven hundred and seventieth

Scientific notation1.38377 × 10^6

Engineering notation1.38377 × 10^6

In other bases

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

Quinary323240040base 5; one hand: 9 digits

Septenary14522213base 7: 8 digits

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

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

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

Sexagesimal6:24:22:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101010001110101011010

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 1d 5a

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

At each machine width

32-bit00000000000101010001110101011010

64-bit0000000000000000000000000000000000000000000101010001110101011010

One's complement11111111111010101110001010100101at 32 bits, every bit flipped

Bits reversed01011010101110001010100000000000at 32 bits

Rotated left by 100000000001010100011101010110100at 32 bits, wrapping

Shifted left by 11010100011101010110100= 2,767,540, no wrap

Shifted right by 110101000111010101101= 691,885, discarding the low bit

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

Nearest landmarks

Next prime1,383,797+27

Previous prime1,383,769−1

Distance to nearest prime1

Nearest square below1,382,976

Nearest square above1,385,329

Powers & multiples

1,383,770 to the power 21,914,819,412,900

1,383,770 to the power 32,649,669,658,988,633,000

1,383,770 to the power 43,666,533,384,018,700,686,410,000

1,383,770 to the power 55,073,638,900,803,557,448,833,565,700,000

First ten multiples1,383,770, 2,767,540, 4,151,310, 5,535,080, 6,918,850, 8,302,620, 9,686,390, 11,070,160, 12,453,930, 13,837,700

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 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 2

Divisible by 10Yes

Divisible by 11No, remainder 3

Divisible by 12No, remainder 2

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 180the total stopping time

Highest value reached2,075,6561× the starting value

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

First steps1,383,770 → 691,885 → 2,075,656 → 1,037,828 → 518,914 → 259,457 → 778,372 → 389,186 → 194,593 → 583,780 → …

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

As a percentage & fraction

As a percentage138,377,000%

1,383,770% as a decimal13,837.7

1,383,770% of 1001,383,770

1,383,770% of 1,00013,837,700

As a fraction of 1001,383,770/100

Read another way

As seconds16 days, 22 minutes and 50 seconds

As bytes1.32 MiB

As a 24-bit colour#151D5A

Keep nerding

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