Recognised as Number
1,360,820
- Positive
- Even
- Composite
- 7 digits
1,360,820 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,360,820
Digit count7
Digit sum20
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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 5 × 68,041
Distinct prime factors32, 5, 68,041
Number of divisors12
Sum of divisors σ(n)2,857,764
Aliquot sum1,496,944sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)544,320integers below n that share no factor with it
Carmichael function λ(n)68,040the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 544,320
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 68,041, 136,082, 272,164, 340,205, 680,410, 1,360,82012 in total
Arithmetic
Previous number1,360,819
Next number1,360,821
Double2,721,640
Half680,410
Square1,851,831,072,400
Cube2,520,008,759,943,368,000
Square root1,166.54189809≈irrational, shown to 9 decimal places
Cube root110.815427915≈
Negation-1,360,820
Reciprocal7.34851046 × 10^-7≈
Representations
Decimal1,360,820
Binary10100110000111011010021 bits
Octal5141664
Hexadecimal14C3B4
Base 36T60K
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixty thousand, eight hundred and twenty
Ordinalone million, three hundred and sixty thousand, eight hundred and twentieth
Scientific notation1.36082 × 10^6
Engineering notation1.36082 × 10^6
In other bases
Ternary2120010200202base 3; the most digit-efficient integer base after e: 13 digits
Quinary322021240base 5; one hand: 9 digits
Septenary14365256base 7: 8 digits
Nonary2503622base 9; each digit is two ternary digits: 7 digits
Duodecimal557618base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8a210base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:18:0:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT0011T01T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011100010011110100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001100001110110100
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes314 c3 b4
Gray code111101010001001101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001100001110110100
64-bit0000000000000000000000000000000000000000000101001100001110110100
One's complement11111111111010110011110001001011at 32 bits, every bit flipped
Bits reversed00101101110000110010100000000000at 32 bits
Rotated left by 100000000001010011000011101101000at 32 bits, wrapping
Shifted left by 11010011000011101101000= 2,721,640, no wrap
Shifted right by 110100110000111011010= 680,410, discarding the low bit
These bits as a double6.72334412 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,360,820 to the power 21,851,831,072,400
1,360,820 to the power 32,520,008,759,943,368,000
1,360,820 to the power 43,429,278,320,706,134,041,760,000
1,360,820 to the power 54,666,630,524,383,321,326,707,843,200,000
First ten multiples1,360,820, 2,721,640, 4,082,460, 5,443,280, 6,804,100, 8,164,920, 9,525,740, 10,886,560, 12,247,380, 13,608,200
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 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 20
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached1,360,820
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,360,820 → 680,410 → 340,205 → 1,020,616 → 510,308 → 255,154 → 127,577 → 382,732 → 191,366 → 95,683 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage136,082,000%
1,360,820% as a decimal13,608.2
1,360,820% of 1001,360,820
1,360,820% of 1,00013,608,200
As a fraction of 1001,360,820/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,360,820
Nerdulate something else
Nothing in mind? Surprise me · today’s page