Base | Representation |
---|---|
bin | 1011000000010111101111… |
… | …0100011000011111011000 |
3 | 1120211211210111202222112002 |
4 | 2300011323310120133120 |
5 | 3041230322022432300 |
6 | 41423042302540132 |
7 | 2356161031403300 |
oct | 260057364303730 |
9 | 46754714688462 |
10 | 12101000202200 |
11 | 3946007161698 |
12 | 1435308597648 |
13 | 69a1724aa540 |
14 | 2db997800600 |
15 | 15eb94d7b5d5 |
hex | b017bd187d8 |
12101000202200 has 144 divisors (see below), whose sum is σ = 35245825685280. Its totient is φ = 3829767056640.
The previous prime is 12101000202167. The next prime is 12101000202227. The reversal of 12101000202200 is 220200010121.
It is a happy number.
12101000202200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 47364752 + ... + 47619551.
It is an arithmetic number, because the mean of its divisors is an integer number (244762678370).
Almost surely, 212101000202200 is an apocalyptic number.
12101000202200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12101000202200 is an abundant number, since it is smaller than the sum of its proper divisors (23144825483080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12101000202200 is a wasteful number, since it uses less digits than its factorization.
12101000202200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94984346 (or 94984330 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 12101000202200 its reverse (220200010121), we get a palindrome (12321200212321).
The spelling of 12101000202200 in words is "twelve trillion, one hundred one billion, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •