Base | Representation |
---|---|
bin | 100111011110100100100… |
… | …000001101111101010100 |
3 | 100121100102120101010112120 |
4 | 213132210200031331110 |
5 | 323421441333213410 |
6 | 5434140513015540 |
7 | 366666541562460 |
oct | 47364440157524 |
9 | 10540376333476 |
10 | 2712884272980 |
11 | 9565894a1472 |
12 | 3799375545b0 |
13 | 168a93113c7b |
14 | 95438dd74a0 |
15 | 4a87d277570 |
hex | 277a480df54 |
2712884272980 has 96 divisors (see below), whose sum is σ = 8800150727424. Its totient is φ = 611593473024.
The previous prime is 2712884272939. The next prime is 2712884272997. The reversal of 2712884272980 is 892724882172.
It is a happy number.
2712884272980 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44210767 + ... + 44272086.
It is an arithmetic number, because the mean of its divisors is an integer number (91668236744).
Almost surely, 22712884272980 is an apocalyptic number.
2712884272980 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2712884272980 is an abundant number, since it is smaller than the sum of its proper divisors (6087266454444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2712884272980 is a wasteful number, since it uses less digits than its factorization.
2712884272980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88482945 (or 88482943 counting only the distinct ones).
The product of its (nonzero) digits is 14450688, while the sum is 60.
The spelling of 2712884272980 in words is "two trillion, seven hundred twelve billion, eight hundred eighty-four million, two hundred seventy-two thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •