Base | Representation |
---|---|
bin | 1010001000100001… |
… | …1000100011010100 |
3 | 21000120100201220220 |
4 | 2202020120203110 |
5 | 21032321403313 |
6 | 1125525154340 |
7 | 124256345154 |
oct | 24210304324 |
9 | 7016321826 |
10 | 2720106708 |
11 | 117647a480 |
12 | 63ab5b9b0 |
13 | 3447065c7 |
14 | 1bb388764 |
15 | 10dc07823 |
hex | a22188d4 |
2720106708 has 48 divisors (see below), whose sum is σ = 6932097984. Its totient is φ = 823299840.
The previous prime is 2720106703. The next prime is 2720106713. The reversal of 2720106708 is 8076010272.
It is an interprime number because it is at equal distance from previous prime (2720106703) and next prime (2720106713).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2720106703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104016 + ... + 127512.
It is an arithmetic number, because the mean of its divisors is an integer number (144418708).
Almost surely, 22720106708 is an apocalyptic number.
It is an amenable number.
2720106708 is an abundant number, since it is smaller than the sum of its proper divisors (4211991276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2720106708 is a wasteful number, since it uses less digits than its factorization.
2720106708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24392 (or 24390 counting only the distinct ones).
The product of its (nonzero) digits is 9408, while the sum is 33.
The square root of 2720106708 is about 52154.6422478383. The cubic root of 2720106708 is about 1395.9246633564.
The spelling of 2720106708 in words is "two billion, seven hundred twenty million, one hundred six thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •