Base | Representation |
---|---|
bin | 10110101110011000… |
… | …00100111100011100 |
3 | 1011111020211110212210 |
4 | 23113030010330130 |
5 | 144441222431022 |
6 | 5334340400420 |
7 | 611222002035 |
oct | 132714047434 |
9 | 34436743783 |
10 | 12200202012 |
11 | 51a0772389 |
12 | 24459a6110 |
13 | 11c578ca5b |
14 | 83a453a8c |
15 | 4b6119a0c |
hex | 2d7304f1c |
12200202012 has 24 divisors (see below), whose sum is σ = 28475823376. Its totient is φ = 4065493248.
The previous prime is 12200201933. The next prime is 12200202013. The reversal of 12200202012 is 21020200221.
12200202012 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 (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200202013) 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 7 ways as a sum of consecutive naturals, for example, 113683 + ... + 193194.
Almost surely, 212200202012 is an apocalyptic number.
12200202012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12200202012 is an abundant number, since it is smaller than the sum of its proper divisors (16275621364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12200202012 is a wasteful number, since it uses less digits than its factorization.
12200202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310197 (or 310195 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 12200202012 its reverse (21020200221), we get a palindrome (33220402233).
The spelling of 12200202012 in words is "twelve billion, two hundred million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •