Base | Representation |
---|---|
bin | 1100000111010101010100… |
… | …1101111110010010000001 |
3 | 1202011101120021222200111001 |
4 | 3001311111031332102001 |
5 | 3221214103031424413 |
6 | 44155102530052001 |
7 | 2543230034012644 |
oct | 301652515762201 |
9 | 52141507880431 |
10 | 13320123311233 |
11 | 427603a399622 |
12 | 15b164241a001 |
13 | 75810b8a7a7b |
14 | 3409a998ba5b |
15 | 18174881d4dd |
hex | c1d5537e481 |
13320123311233 has 2 divisors, whose sum is σ = 13320123311234. Its totient is φ = 13320123311232.
The previous prime is 13320123311203. The next prime is 13320123311431. The reversal of 13320123311233 is 33211332102331.
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., 7215922945009 + 6104200366224 = 2686247^2 + 2470668^2 .
It is an emirp because it is prime and its reverse (33211332102331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13320123311233 - 233 = 13311533376641 is a prime.
It is not a weakly prime, because it can be changed into another prime (13320123311203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660061655616 + 6660061655617.
It is an arithmetic number, because the mean of its divisors is an integer number (6660061655617).
Almost surely, 213320123311233 is an apocalyptic number.
It is an amenable number.
13320123311233 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320123311233 is an equidigital number, since it uses as much as digits as its factorization.
13320123311233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 13320123311233 its reverse (33211332102331), we get a palindrome (46531455413564).
The spelling of 13320123311233 in words is "thirteen trillion, three hundred twenty billion, one hundred twenty-three million, three hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •