Base | Representation |
---|---|
bin | 10110101110011110… |
… | …01100101100101001 |
3 | 1011111022101001020002 |
4 | 23113033030230221 |
5 | 144441430121301 |
6 | 5334410112345 |
7 | 611231650316 |
oct | 132717145451 |
9 | 34438331202 |
10 | 12201020201 |
11 | 51a1181077 |
12 | 244611b6b5 |
13 | 11c59b82a6 |
14 | 83a5c7d0d |
15 | 4b622c16b |
hex | 2d73ccb29 |
12201020201 has 4 divisors (see below), whose sum is σ = 12203675472. Its totient is φ = 12198364932.
The previous prime is 12201020179. The next prime is 12201020203. The reversal of 12201020201 is 10202010221.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10202010221 = 13 ⋅784770017.
It is a cyclic number.
It is not a de Polignac number, because 12201020201 - 214 = 12201003817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12201020203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1320731 + ... + 1329936.
It is an arithmetic number, because the mean of its divisors is an integer number (3050918868).
Almost surely, 212201020201 is an apocalyptic number.
It is an amenable number.
12201020201 is a deficient number, since it is larger than the sum of its proper divisors (2655271).
12201020201 is an equidigital number, since it uses as much as digits as its factorization.
12201020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2655270.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 12201020201 its reverse (10202010221), we get a palindrome (22403030422).
The spelling of 12201020201 in words is "twelve billion, two hundred one million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •