Recognised as Number

1,361,770

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,361,770

Digit count7

Digit sum25

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 136,177

Distinct prime factors32, 5, 136,177

Number of divisors8

Sum of divisors σ(n)2,451,204

Aliquot sum1,089,434sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)136,176the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 544,704

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 136,177, 272,354, 680,885, 1,361,7708 in total

Arithmetic

Previous number1,361,769

Next number1,361,771

Double2,723,540

Half680,885

Square1,854,417,532,900

Cube2,525,290,163,777,233,000

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

Cube root110.84120898≈

Negation-1,361,770

Reciprocal7.34338398 × 10^-7≈

Representations

Decimal1,361,770

Binary10100110001110110101021 bits

Octal5143552

Hexadecimal14C76A

Base 36T6QY

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

In wordsone million, three hundred and sixty-one thousand, seven hundred and seventy

Ordinalone million, three hundred and sixty-one thousand, seven hundred and seventieth

Scientific notation1.36177 × 10^6

Engineering notation1.36177 × 10^6

In other bases

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

Quinary322034040base 5; one hand: 9 digits

Septenary14401114base 7: 8 digits

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

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

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

Sexagesimal6:18:16:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101001100011101101010

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

Bytes314 c7 6a

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

At each machine width

32-bit00000000000101001100011101101010

64-bit0000000000000000000000000000000000000000000101001100011101101010

One's complement11111111111010110011100010010101at 32 bits, every bit flipped

Bits reversed01010110111000110010100000000000at 32 bits

Rotated left by 100000000001010011000111011010100at 32 bits, wrapping

Shifted left by 11010011000111011010100= 2,723,540, no wrap

Shifted right by 110100110001110110101= 680,885, discarding the low bit

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

Nearest landmarks

Next prime1,361,777+7

Previous prime1,361,743−27

Distance to nearest prime7

Nearest square below1,359,556

Nearest square above1,361,889

Powers & multiples

1,361,770 to the power 21,854,417,532,900

1,361,770 to the power 32,525,290,163,777,233,000

1,361,770 to the power 43,438,864,386,326,922,582,410,000

1,361,770 to the power 54,682,942,355,368,413,365,048,465,700,000

First ten multiples1,361,770, 2,723,540, 4,085,310, 5,447,080, 6,808,850, 8,170,620, 9,532,390, 10,894,160, 12,255,930, 13,617,700

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 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 2

Divisible by 9No, remainder 7

Divisible by 10Yes

Divisible by 11No, remainder 3

Divisible by 12No, remainder 10

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1106the total stopping time

Highest value reached2,042,6561× the starting value

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

First steps1,361,770 → 680,885 → 2,042,656 → 1,021,328 → 510,664 → 255,332 → 127,666 → 63,833 → 191,500 → 95,750 → …

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

As a percentage & fraction

As a percentage136,177,000%

1,361,770% as a decimal13,617.7

1,361,770% of 1001,361,770

1,361,770% of 1,00013,617,700

As a fraction of 1001,361,770/100

Read another way

As seconds15 days, 18 hours and 16 minutes

As bytes1.299 MiB

As a 24-bit colour#14C76A

Keep nerding

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