Base | Representation |
---|---|
bin | 1100000111111110001110… |
… | …1011010110010010101101 |
3 | 1202012102220111210110120212 |
4 | 3001333203223112102231 |
5 | 3221404044421423041 |
6 | 44204120241352205 |
7 | 2544066111326066 |
oct | 301774353262255 |
9 | 52172814713525 |
10 | 13331103311021 |
11 | 427a764306a11 |
12 | 15b37a7638665 |
13 | 75916b61bb72 |
14 | 34132bd3356d |
15 | 181b8c75b8eb |
hex | c1fe3ad64ad |
13331103311021 has 2 divisors, whose sum is σ = 13331103311022. Its totient is φ = 13331103311020.
The previous prime is 13331103310937. The next prime is 13331103311033. The reversal of 13331103311021 is 12011330113331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13086089200900 + 245014110121 = 3617470^2 + 494989^2 .
It is an emirp because it is prime and its reverse (12011330113331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13331103311021 - 218 = 13331103048877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13331103311221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665551655510 + 6665551655511.
It is an arithmetic number, because the mean of its divisors is an integer number (6665551655511).
Almost surely, 213331103311021 is an apocalyptic number.
It is an amenable number.
13331103311021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13331103311021 is an equidigital number, since it uses as much as digits as its factorization.
13331103311021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13331103311021 its reverse (12011330113331), we get a palindrome (25342433424352).
The spelling of 13331103311021 in words is "thirteen trillion, three hundred thirty-one billion, one hundred three million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •