Base | Representation |
---|---|
bin | 10001101000110111100… |
… | …100111010010001010011 |
3 | 11021212200020211102211022 |
4 | 101220313210322101103 |
5 | 124324401434401321 |
6 | 2324500452310055 |
7 | 153400203130364 |
oct | 21506744722123 |
9 | 4255606742738 |
10 | 1212113200211 |
11 | 428066335761 |
12 | 176aba31232b |
13 | 8a3c00353b4 |
14 | 429491b1b6b |
15 | 217e336bdab |
hex | 11a3793a453 |
1212113200211 has 12 divisors (see below), whose sum is σ = 1305535510872. Its totient is φ = 1121476565184.
The previous prime is 1212113200171. The next prime is 1212113200213. The reversal of 1212113200211 is 1120023112121.
It is a happy number.
It is not a de Polignac number, because 1212113200211 - 222 = 1212109005907 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1212113200211.
It is not an unprimeable number, because it can be changed into a prime (1212113200213) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10182245 + ... + 10300598.
It is an arithmetic number, because the mean of its divisors is an integer number (108794625906).
Almost surely, 21212113200211 is an apocalyptic number.
1212113200211 is a deficient number, since it is larger than the sum of its proper divisors (93422310661).
1212113200211 is an equidigital number, since it uses as much as digits as its factorization.
1212113200211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20482978 (or 20482919 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1212113200211 its reverse (1120023112121), we get a palindrome (2332136312332).
The spelling of 1212113200211 in words is "one trillion, two hundred twelve billion, one hundred thirteen million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •