Base | Representation |
---|---|
bin | 1100000111010101010100… |
… | …1101111110011101111001 |
3 | 1202011101120021222201112012 |
4 | 3001311111031332131321 |
5 | 3221214103031440433 |
6 | 44155102530055305 |
7 | 2543230034015111 |
oct | 301652515763571 |
9 | 52141507881465 |
10 | 13320123311993 |
11 | 427603a39a153 |
12 | 15b164241a535 |
13 | 75810b8a8214 |
14 | 3409a998c041 |
15 | 18174881d848 |
hex | c1d5537e779 |
13320123311993 has 2 divisors, whose sum is σ = 13320123311994. Its totient is φ = 13320123311992.
The previous prime is 13320123311941. The next prime is 13320123312029. The reversal of 13320123311993 is 39911332102331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12765950264809 + 554173047184 = 3572947^2 + 744428^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13320123311993 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13320123311993.
It is not a weakly prime, because it can be changed into another prime (13320123311893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660061655996 + 6660061655997.
It is an arithmetic number, because the mean of its divisors is an integer number (6660061655997).
Almost surely, 213320123311993 is an apocalyptic number.
It is an amenable number.
13320123311993 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320123311993 is an equidigital number, since it uses as much as digits as its factorization.
13320123311993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 78732, while the sum is 41.
The spelling of 13320123311993 in words is "thirteen trillion, three hundred twenty billion, one hundred twenty-three million, three hundred eleven thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •