Base | Representation |
---|---|
bin | 1011101101100100101… |
… | …1101011000000001011 |
3 | 201020100211021101122221 |
4 | 2323121023223000023 |
5 | 11244040311224321 |
6 | 232234031554511 |
7 | 20352140401324 |
oct | 2733113530013 |
9 | 636324241587 |
10 | 201212211211 |
11 | 78374058450 |
12 | 32bb568ba37 |
13 | 15c884ca80b |
14 | 9a4b0ad44b |
15 | 5379ac2e41 |
hex | 2ed92eb00b |
201212211211 has 8 divisors (see below), whose sum is σ = 221677540848. Its totient is φ = 181109100000.
The previous prime is 201212211197. The next prime is 201212211217. The reversal of 201212211211 is 112112212102.
201212211211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201212211211 - 29 = 201212210699 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201212211217) 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 7 ways as a sum of consecutive naturals, for example, 90553440 + ... + 90555661.
It is an arithmetic number, because the mean of its divisors is an integer number (27709692606).
Almost surely, 2201212211211 is an apocalyptic number.
201212211211 is a deficient number, since it is larger than the sum of its proper divisors (20465329637).
201212211211 is a wasteful number, since it uses less digits than its factorization.
201212211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181109213.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201212211211 its reverse (112112212102), we get a palindrome (313324423313).
The spelling of 201212211211 in words is "two hundred one billion, two hundred twelve million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •