Recognised as Number

1,376,789

Positive
Odd
Prime
7 digits

1,376,789 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,376,789

Digit count7

Digit sum41

Digit product63,504

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,376,789

Distinct prime factors11,376,789

Number of divisors2

Sum of divisors σ(n)1,376,790

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,376,788the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 1,376,7892 in total

Arithmetic

Previous number1,376,788

Next number1,376,790

Double2,753,578

Half688,394.5

Square1,895,547,950,521

Cube2,609,769,567,249,857,069

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

Cube root111.247210299≈

Negation-1,376,789

Reciprocal7.26327709 × 10^-7≈

Representations

Decimal1,376,789

Binary10101000000100001010121 bits

Octal5201025

Hexadecimal150215

Base 36TIC5

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

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

Ordinalone million, three hundred and seventy-six thousand, seven hundred and eighty-ninth

Scientific notation1.376789 × 10^6

Engineering notation1.376789 × 10^6

In other bases

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

Quinary323024124base 5; one hand: 9 digits

Septenary14462651base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101010000001000010101

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes315 02 15

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

At each machine width

32-bit00000000000101010000001000010101

64-bit0000000000000000000000000000000000000000000101010000001000010101

One's complement11111111111010101111110111101010at 32 bits, every bit flipped

Bits reversed10101000010000001010100000000000at 32 bits

Rotated left by 100000000001010100000010000101010at 32 bits, wrapping

Shifted left by 11010100000010000101010= 2,753,578, no wrap

Shifted right by 110101000000100001010= 688,394, discarding the low bit

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

Nearest landmarks

Next prime1,376,819+30

Previous prime1,376,777−12

Distance to nearest prime0, it is prime

Nearest square below1,375,929

Nearest square above1,378,276

Powers & multiples

1,376,789 to the power 21,895,547,950,521

1,376,789 to the power 32,609,769,567,249,857,069

1,376,789 to the power 43,593,102,032,724,363,464,171,441

1,376,789 to the power 54,946,943,354,532,543,649,473,134,082,949

First ten multiples1,376,789, 2,753,578, 4,130,367, 5,507,156, 6,883,945, 8,260,734, 9,637,523, 11,014,312, 12,391,101, 13,767,890

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 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 5

Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 1199the total stopping time

Highest value reached4,130,3683× the starting value

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

First steps1,376,789 → 4,130,368 → 2,065,184 → 1,032,592 → 516,296 → 258,148 → 129,074 → 64,537 → 193,612 → 96,806 → …

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

As a percentage & fraction

As a percentage137,678,900%

1,376,789% as a decimal13,767.89

1,376,789% of 1001,376,789

1,376,789% of 1,00013,767,890

As a fraction of 1001,376,789/100

Read another way

As seconds15 days, 22 hours and 26 minutes

As bytes1.313 MiB

As a 24-bit colour#150215

Keep nerding

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