Recognised as Number
1,080,707
- Positive
- Odd
- Composite
- 7 digits
1,080,707 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,080,707
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation17 × 151 × 421
Distinct prime factors317, 151, 421
Number of divisors8
Sum of divisors σ(n)1,154,592
Aliquot sum73,885sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,008,000integers below n that share no factor with it
Carmichael function λ(n)8,400the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,008,000
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 151, 421, 2,567, 7,157, 63,571, 1,080,7078 in total
Arithmetic
Previous number1,080,706
Next number1,080,708
Double2,161,414
Half540,353.5
Square1,167,927,619,849
Cube1,262,187,554,264,153,243
Square root1,039.570584424≈irrational, shown to 9 decimal places
Cube root102.620939936≈
Negation-1,080,707
Reciprocal9.25320184 × 10^-7≈
Representations
Decimal1,080,707
Binary10000011111011000001121 bits
Octal4076603
Hexadecimal107D83
Base 36N5VN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, eighty thousand, seven hundred and seven
Ordinalone million, eighty thousand, seven hundred and seventh
Scientific notation1.080707 × 10^6
Engineering notation1.080707 × 10^6
In other bases
Ternary2000220110012base 3; the most digit-efficient integer base after e: 13 digits
Quinary234040312base 5; one hand: 9 digits
Septenary12120515base 7: 8 digits
Nonary2026405base 9; each digit is two ternary digits: 7 digits
Duodecimal4414abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6f1f7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:0:11:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0010T01101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011000001010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000111110110000011
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
Bytes310 7d 83
Gray code110000100001101000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000111110110000011
64-bit0000000000000000000000000000000000000000000100000111110110000011
One's complement11111111111011111000001001111100at 32 bits, every bit flipped
Bits reversed11000001101111100000100000000000at 32 bits
Rotated left by 100000000001000001111101100000110at 32 bits, wrapping
Shifted left by 11000001111101100000110= 2,161,414, no wrap
Shifted right by 110000011111011000001= 540,353, discarding the low bit
These bits as a double5.33940202 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,080,707 to the power 21,167,927,619,849
1,080,707 to the power 31,262,187,554,264,153,243
1,080,707 to the power 41,364,054,925,206,150,258,782,801
1,080,707 to the power 51,474,143,706,054,763,027,718,384,520,307
First ten multiples1,080,707, 2,161,414, 3,242,121, 4,322,828, 5,403,535, 6,484,242, 7,564,949, 8,645,656, 9,726,363, 10,807,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1147the total stopping time
Highest value reached4,863,1844× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,080,707 → 3,242,122 → 1,621,061 → 4,863,184 → 2,431,592 → 1,215,796 → 607,898 → 303,949 → 911,848 → 455,924 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage108,070,700%
1,080,707% as a decimal10,807.07
1,080,707% of 1001,080,707
1,080,707% of 1,00010,807,070
As a fraction of 1001,080,707/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,080,707
Nerdulate something else
Nothing in mind? Surprise me · today’s page