Base | Representation |
---|---|
bin | 1011111100010101100111… |
… | …0001101001100001000011 |
3 | 1201111022222101100201201212 |
4 | 2333011121301221201003 |
5 | 3210120220112224303 |
6 | 43532222202320335 |
7 | 2523461621446304 |
oct | 277053161514103 |
9 | 51438871321655 |
10 | 13131221211203 |
11 | 4202a13052987 |
12 | 1580b034b90ab |
13 | 74336586cc14 |
14 | 3357a97827ab |
15 | 17b88e825ad8 |
hex | bf159c69843 |
13131221211203 has 2 divisors, whose sum is σ = 13131221211204. Its totient is φ = 13131221211202.
The previous prime is 13131221211149. The next prime is 13131221211271. The reversal of 13131221211203 is 30211212213131.
It is a happy number.
13131221211203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (30211212213131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13131221211203 is a prime.
It is not a weakly prime, because it can be changed into another prime (13131221811203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565610605601 + 6565610605602.
It is an arithmetic number, because the mean of its divisors is an integer number (6565610605602).
Almost surely, 213131221211203 is an apocalyptic number.
13131221211203 is a deficient number, since it is larger than the sum of its proper divisors (1).
13131221211203 is an equidigital number, since it uses as much as digits as its factorization.
13131221211203 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 13131221211203 its reverse (30211212213131), we get a palindrome (43342433424334).
The spelling of 13131221211203 in words is "thirteen trillion, one hundred thirty-one billion, two hundred twenty-one million, two hundred eleven thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •