Base | Representation |
---|---|
bin | 100111011000001011011… |
… | …011001111100111000000 |
3 | 100120200201021002012020102 |
4 | 213120023123033213000 |
5 | 323313412344301210 |
6 | 5431043503101532 |
7 | 366334503506051 |
oct | 47301333174700 |
9 | 10520637065212 |
10 | 2706021087680 |
11 | 9536873a37a9 |
12 | 378540ba18a8 |
13 | 16823b271591 |
14 | 94d876d2728 |
15 | 4a5ca985ea5 |
hex | 2760b6cf9c0 |
2706021087680 has 56 divisors (see below), whose sum is σ = 6822754653168. Its totient is φ = 1018737348608.
The previous prime is 2706021087677. The next prime is 2706021087683. The reversal of 2706021087680 is 867801206072.
2706021087680 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (2706021087677) and next prime (2706021087683).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2706021087683) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248709734 + ... + 248720613.
Almost surely, 22706021087680 is an apocalyptic number.
2706021087680 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2706021087680 is an abundant number, since it is smaller than the sum of its proper divisors (4116733565488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2706021087680 is a wasteful number, since it uses less digits than its factorization.
2706021087680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497430381 (or 497430371 counting only the distinct ones).
The product of its (nonzero) digits is 451584, while the sum is 47.
The spelling of 2706021087680 in words is "two trillion, seven hundred six billion, twenty-one million, eighty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •