Base | Representation |
---|---|
bin | 10110101110101000… |
… | …00101111101000100 |
3 | 1011111101210020022021 |
4 | 23113110011331010 |
5 | 144442242201200 |
6 | 5334453412524 |
7 | 611245603165 |
oct | 132724057504 |
9 | 34441706267 |
10 | 12202303300 |
11 | 51a1978090 |
12 | 244663a144 |
13 | 11c6047315 |
14 | 83a83d76c |
15 | 4b63d241a |
hex | 2d7505f44 |
12202303300 has 72 divisors (see below), whose sum is σ = 29375932320. Its totient is φ = 4361971200.
The previous prime is 12202303283. The next prime is 12202303301. The reversal of 12202303300 is 330320221.
12202303300 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 (12202303301) 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, 29109 + ... + 158908.
It is an arithmetic number, because the mean of its divisors is an integer number (407999060).
Almost surely, 212202303300 is an apocalyptic number.
12202303300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12202303300 is an abundant number, since it is smaller than the sum of its proper divisors (17173629020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12202303300 is a wasteful number, since it uses less digits than its factorization.
12202303300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188101 (or 188094 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 12202303300 its reverse (330320221), we get a palindrome (12532623521).
The spelling of 12202303300 in words is "twelve billion, two hundred two million, three hundred three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •