Base | Representation |
---|---|
bin | 1100000111111110001110… |
… | …1011010110010010111001 |
3 | 1202012102220111210110121022 |
4 | 3001333203223112102321 |
5 | 3221404044421423113 |
6 | 44204120241352225 |
7 | 2544066111326114 |
oct | 301774353262271 |
9 | 52172814713538 |
10 | 13331103311033 |
11 | 427a764306a22 |
12 | 15b37a7638675 |
13 | 75916b61bb81 |
14 | 34132bd3357b |
15 | 181b8c75b908 |
hex | c1fe3ad64b9 |
13331103311033 has 2 divisors, whose sum is σ = 13331103311034. Its totient is φ = 13331103311032.
The previous prime is 13331103311021. The next prime is 13331103311047. The reversal of 13331103311033 is 33011330113331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13074067492864 + 257035818169 = 3615808^2 + 506987^2 .
It is a cyclic number.
It is not a de Polignac number, because 13331103311033 - 210 = 13331103310009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13331103310993 and 13331103311011.
It is not a weakly prime, because it can be changed into another prime (13331103311083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665551655516 + 6665551655517.
It is an arithmetic number, because the mean of its divisors is an integer number (6665551655517).
Almost surely, 213331103311033 is an apocalyptic number.
It is an amenable number.
13331103311033 is a deficient number, since it is larger than the sum of its proper divisors (1).
13331103311033 is an equidigital number, since it uses as much as digits as its factorization.
13331103311033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2187, while the sum is 26.
Adding to 13331103311033 its reverse (33011330113331), we get a palindrome (46342433424364).
The spelling of 13331103311033 in words is "thirteen trillion, three hundred thirty-one billion, one hundred three million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.466 sec. • engine limits •