Base | Representation |
---|---|
bin | 10110101110011000… |
… | …00100011110100101 |
3 | 1011111020211101021000 |
4 | 23113030010132211 |
5 | 144441222400401 |
6 | 5334340343513 |
7 | 611221663335 |
oct | 132714043645 |
9 | 34436741230 |
10 | 12200200101 |
11 | 51a0770a01 |
12 | 24459a4b99 |
13 | 11c578bc1b |
14 | 83a4530c5 |
15 | 4b6119186 |
hex | 2d73047a5 |
12200200101 has 16 divisors (see below), whose sum is σ = 18077233600. Its totient is φ = 8132178384.
The previous prime is 12200200099. The next prime is 12200200139. The reversal of 12200200101 is 10100200221.
12200200101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12200200101 - 21 = 12200200099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200200801) 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 15 ways as a sum of consecutive naturals, for example, 156630 + ... + 221208.
It is an arithmetic number, because the mean of its divisors is an integer number (1129827100).
Almost surely, 212200200101 is an apocalyptic number.
It is an amenable number.
12200200101 is a deficient number, since it is larger than the sum of its proper divisors (5877033499).
12200200101 is an equidigital number, since it uses as much as digits as its factorization.
12200200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71585 (or 71579 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 12200200101 its reverse (10100200221), we get a palindrome (22300400322).
The spelling of 12200200101 in words is "twelve billion, two hundred million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •