Base | Representation |
---|---|
bin | 1100000111010101111111… |
… | …0100010011000100000111 |
3 | 1202011102000200120210221222 |
4 | 3001311133310103010013 |
5 | 3221214434042124431 |
6 | 44155132321230555 |
7 | 2543234323314662 |
oct | 301653764230407 |
9 | 52142020523858 |
10 | 13320301129991 |
11 | 4276120801479 |
12 | 15b1691a9245b |
13 | 758139696b7b |
14 | 3409c54386d9 |
15 | 18175924557b |
hex | c1d5fd13107 |
13320301129991 has 2 divisors, whose sum is σ = 13320301129992. Its totient is φ = 13320301129990.
The previous prime is 13320301129987. The next prime is 13320301130153. The reversal of 13320301129991 is 19992110302331.
13320301129991 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (19992110302331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13320301129991 - 22 = 13320301129987 is a prime.
It is a super-2 number, since 2×133203011299912 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13320301129391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660150564995 + 6660150564996.
It is an arithmetic number, because the mean of its divisors is an integer number (6660150564996).
Almost surely, 213320301129991 is an apocalyptic number.
13320301129991 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320301129991 is an equidigital number, since it uses as much as digits as its factorization.
13320301129991 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 44.
The spelling of 13320301129991 in words is "thirteen trillion, three hundred twenty billion, three hundred one million, one hundred twenty-nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •