Base | Representation |
---|---|
bin | 1100000110001010110001… |
… | …1001100001011101100101 |
3 | 1202002110220121112001022122 |
4 | 3001202230121201131211 |
5 | 3220402111421321404 |
6 | 44141553043235325 |
7 | 2541621103132523 |
oct | 301425431413545 |
9 | 52073817461278 |
10 | 13300111120229 |
11 | 42685aaaa329a |
12 | 15a9798378b45 |
13 | 75626c82222b |
14 | 33da2bc11313 |
15 | 180e769953be |
hex | c18ac661765 |
13300111120229 has 2 divisors, whose sum is σ = 13300111120230. Its totient is φ = 13300111120228.
The previous prime is 13300111120211. The next prime is 13300111120249. The reversal of 13300111120229 is 92202111100331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7805446955329 + 5494664164900 = 2793823^2 + 2344070^2 .
It is an emirp because it is prime and its reverse (92202111100331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13300111120229 - 228 = 13299842684773 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13300111120198 and 13300111120207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13300111120249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650055560114 + 6650055560115.
It is an arithmetic number, because the mean of its divisors is an integer number (6650055560115).
Almost surely, 213300111120229 is an apocalyptic number.
It is an amenable number.
13300111120229 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300111120229 is an equidigital number, since it uses as much as digits as its factorization.
13300111120229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 13300111120229 in words is "thirteen trillion, three hundred billion, one hundred eleven million, one hundred twenty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •