Base | Representation |
---|---|
bin | 10110011111000011… |
… | …11001101010000100 |
3 | 1011011022001011102100 |
4 | 23033201321222010 |
5 | 144210324031340 |
6 | 5313510312100 |
7 | 605101541601 |
oct | 131741715204 |
9 | 34138034370 |
10 | 12071705220 |
11 | 5135187893 |
12 | 240a958630 |
13 | 11a4c7c553 |
14 | 8273656a8 |
15 | 4a9bd6830 |
hex | 2cf879a84 |
12071705220 has 72 divisors (see below), whose sum is σ = 36836864064. Its totient is φ = 3199837248.
The previous prime is 12071705197. The next prime is 12071705221. The reversal of 12071705220 is 2250717021.
12071705220 is a `hidden beast` number, since 1 + 2 + 0 + 71 + 70 + 522 + 0 = 666.
12071705220 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (12071705221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 170734 + ... + 230853.
It is an arithmetic number, because the mean of its divisors is an integer number (511623112).
Almost surely, 212071705220 is an apocalyptic number.
12071705220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12071705220 is an abundant number, since it is smaller than the sum of its proper divisors (24765158844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12071705220 is a wasteful number, since it uses less digits than its factorization.
12071705220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401769 (or 401764 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The spelling of 12071705220 in words is "twelve billion, seventy-one million, seven hundred five thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •