Recognised as Number
1,080,709
- Positive
- Odd
- Composite
- 7 digits
1,080,709 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,080,709
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 factorisation7 × 154,387
Distinct prime factors27, 154,387
Number of divisors4
Sum of divisors σ(n)1,235,104
Aliquot sum154,395sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)926,316integers below n that share no factor with it
Carmichael function λ(n)154,386the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 926,316
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 154,387, 1,080,7094 in total
Arithmetic
Previous number1,080,708
Next number1,080,710
Double2,161,418
Half540,354.5
Square1,167,931,942,681
Cube1,262,194,561,842,840,829
Square root1,039.571546359≈irrational, shown to 9 decimal places
Cube root102.62100324≈
Negation-1,080,709
Reciprocal9.25318471 × 10^-7≈
Representations
Decimal1,080,709
Binary10000011111011000010121 bits
Octal4076605
Hexadecimal107D85
Base 36N5VP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, eighty thousand, seven hundred and nine
Ordinalone million, eighty thousand, seven hundred and ninth
Scientific notation1.080709 × 10^6
Engineering notation1.080709 × 10^6
In other bases
Ternary2000220110021base 3; the most digit-efficient integer base after e: 13 digits
Quinary234040314base 5; one hand: 9 digits
Septenary12120520base 7: 8 digits
Nonary2026407base 9; each digit is two ternary digits: 7 digits
Duodecimal4414b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6f1f9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:0:11:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0010T01101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011000001010000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000111110110000101
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 85
Gray code110000100001101000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000111110110000101
64-bit0000000000000000000000000000000000000000000100000111110110000101
One's complement11111111111011111000001001111010at 32 bits, every bit flipped
Bits reversed10100001101111100000100000000000at 32 bits
Rotated left by 100000000001000001111101100001010at 32 bits, wrapping
Shifted left by 11000001111101100001010= 2,161,418, no wrap
Shifted right by 110000011111011000010= 540,354, discarding the low bit
These bits as a double5.3394119 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,080,709 to the power 21,167,931,942,681
1,080,709 to the power 31,262,194,561,842,840,829
1,080,709 to the power 41,364,065,022,734,614,669,467,761
1,080,709 to the power 51,474,157,346,654,502,684,825,834,522,549
First ten multiples1,080,709, 2,161,418, 3,242,127, 4,322,836, 5,403,545, 6,484,254, 7,564,963, 8,645,672, 9,726,381, 10,807,090
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1147the total stopping time
Highest value reached3,242,1283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,080,709 → 3,242,128 → 1,621,064 → 810,532 → 405,266 → 202,633 → 607,900 → 303,950 → 151,975 → 455,926 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage108,070,900%
1,080,709% as a decimal10,807.09
1,080,709% of 1001,080,709
1,080,709% of 1,00010,807,090
As a fraction of 1001,080,709/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,709
Nerdulate something else
Nothing in mind? Surprise me · today’s page