Base | Representation |
---|---|
bin | 1011111011001110110011… |
… | …0000000001111000111101 |
3 | 1201102111220121112221221201 |
4 | 2332303230300001320331 |
5 | 3204312302310413041 |
6 | 43515400033255501 |
7 | 2522216561515453 |
oct | 276635460017075 |
9 | 51374817487851 |
10 | 13112212201021 |
11 | 41a5948a5320a |
12 | 1579299404591 |
13 | 7416265992bb |
14 | 3348c4d409d3 |
15 | 17b12aaab631 |
hex | bececc01e3d |
13112212201021 has 2 divisors, whose sum is σ = 13112212201022. Its totient is φ = 13112212201020.
The previous prime is 13112212200959. The next prime is 13112212201063. The reversal of 13112212201021 is 12010221221131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12550446960921 + 561765240100 = 3542661^2 + 749510^2 .
It is a cyclic number.
It is not a de Polignac number, because 13112212201021 - 221 = 13112210103869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13112212201021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13112212801021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556106100510 + 6556106100511.
It is an arithmetic number, because the mean of its divisors is an integer number (6556106100511).
Almost surely, 213112212201021 is an apocalyptic number.
It is an amenable number.
13112212201021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13112212201021 is an equidigital number, since it uses as much as digits as its factorization.
13112212201021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 13112212201021 its reverse (12010221221131), we get a palindrome (25122433422152).
The spelling of 13112212201021 in words is "thirteen trillion, one hundred twelve billion, two hundred twelve million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •