Recognised as Number
2,708,320
- Positive
- Even
- Composite
- 7 digits
2,708,320 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,708,320
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^5 × 5 × 16,927
Distinct prime factors32, 5, 16,927
Number of divisors24
Sum of divisors σ(n)6,398,784
Aliquot sum3,690,464sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,083,264integers below n that share no factor with it
Carmichael function λ(n)67,704the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,083,264
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160, 16,927, 33,854, 67,708, 84,635, 135,416, 169,270, 270,832, 338,540, 541,664, 677,080, 1,354,160, 2,708,32024 in total
Arithmetic
Previous number2,708,319
Next number2,708,321
Double5,416,640
Half1,354,160
Square7,334,997,222,400
Cube19,865,519,677,370,368,000
Square root1,645.697420549≈irrational, shown to 9 decimal places
Cube root139.390548045≈
Negation-2,708,320
Reciprocal3.69232587 × 10^-7≈
Representations
Decimal2,708,320
Binary101001010100110110000022 bits
Octal12251540
Hexadecimal295360
Base 361M1R4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and eight thousand, three hundred and twenty
Ordinaltwo million, seven hundred and eight thousand, three hundred and twentieth
Scientific notation2.70832 × 10^6
Engineering notation2.70832 × 10^6
In other bases
Ternary12002121010011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1143131240base 5; one hand: 10 digits
Septenary32006656base 7: 8 digits
Nonary5077104base 9; each digit is two ternary digits: 7 digits
Duodecimalaa7394base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgiag0base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:32:18:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT010TT1010011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110010101010010100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010101001101100000
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes329 53 60
Gray code1111011111101011010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010101001101100000
64-bit0000000000000000000000000000000000000000001010010101001101100000
One's complement11111111110101101010110010011111at 32 bits, every bit flipped
Bits reversed00000110110010101001010000000000at 32 bits
Rotated left by 100000000010100101010011011000000at 32 bits, wrapping
Shifted left by 110100101010011011000000= 5,416,640, no wrap
Shifted right by 1101001010100110110000= 1,354,160, discarding the low bit
These bits as a double1.33808787 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,708,320 to the power 27,334,997,222,400
2,708,320 to the power 319,865,519,677,370,368,000
2,708,320 to the power 453,802,184,252,615,715,061,760,000
2,708,320 to the power 5145,713,531,655,044,193,416,065,843,200,000
First ten multiples2,708,320, 5,416,640, 8,124,960, 10,833,280, 13,541,600, 16,249,920, 18,958,240, 21,666,560, 24,374,880, 27,083,200
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 4
Divisible by 100No, remainder 20
Collatz (3n + 1) trajectory
Steps to reach 186the total stopping time
Highest value reached2,708,320
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,708,320 → 1,354,160 → 677,080 → 338,540 → 169,270 → 84,635 → 253,906 → 126,953 → 380,860 → 190,430 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage270,832,000%
2,708,320% as a decimal27,083.2
2,708,320% of 1002,708,320
2,708,320% of 1,00027,083,200
As a fraction of 1002,708,320/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 2,708,320
Nerdulate something else
Nothing in mind? Surprise me · today’s page