Base | Representation |
---|---|
bin | 10110011100110100… |
… | …00011001101011100 |
3 | 1011002222121020022212 |
4 | 23032122003031130 |
5 | 144141013314410 |
6 | 5311554455552 |
7 | 604452463424 |
oct | 131632031534 |
9 | 34088536285 |
10 | 12052869980 |
11 | 5125592678 |
12 | 24045945b8 |
13 | 11a10b6338 |
14 | 824a61484 |
15 | 4a8215b05 |
hex | 2ce68335c |
12052869980 has 24 divisors (see below), whose sum is σ = 25421565120. Its totient is φ = 4800093120.
The previous prime is 12052869953. The next prime is 12052870007. The reversal of 12052869980 is 8996825021.
12052869980 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 (12052869953) and next prime (12052870007).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1311236 + ... + 1320395.
It is an arithmetic number, because the mean of its divisors is an integer number (1059231880).
Almost surely, 212052869980 is an apocalyptic number.
12052869980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12052869980 is an abundant number, since it is smaller than the sum of its proper divisors (13368695140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12052869980 is a wasteful number, since it uses less digits than its factorization.
12052869980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2631869 (or 2631867 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 50.
The spelling of 12052869980 in words is "twelve billion, fifty-two million, eight hundred sixty-nine thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •