Base | Representation |
---|---|
bin | 1100000110001011100100… |
… | …0101101001010110100101 |
3 | 1202002111110110010010221202 |
4 | 3001202321011221112211 |
5 | 3220403030421412402 |
6 | 44142030130252245 |
7 | 2541626266526534 |
oct | 301427105512645 |
9 | 52074413103852 |
10 | 13300324013477 |
11 | 42686aa192126 |
12 | 15a9837727085 |
13 | 7562a4971c77 |
14 | 33da4c1cc31b |
15 | 180e8a4e9b02 |
hex | c18b91695a5 |
13300324013477 has 2 divisors, whose sum is σ = 13300324013478. Its totient is φ = 13300324013476.
The previous prime is 13300324013393. The next prime is 13300324013551. The reversal of 13300324013477 is 77431042300331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7490517608161 + 5809806405316 = 2736881^2 + 2410354^2 .
It is an emirp because it is prime and its reverse (77431042300331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13300324013477 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13300324013477.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13300324013677) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650162006738 + 6650162006739.
It is an arithmetic number, because the mean of its divisors is an integer number (6650162006739).
Almost surely, 213300324013477 is an apocalyptic number.
It is an amenable number.
13300324013477 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300324013477 is an equidigital number, since it uses as much as digits as its factorization.
13300324013477 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 127008, while the sum is 38.
The spelling of 13300324013477 in words is "thirteen trillion, three hundred billion, three hundred twenty-four million, thirteen thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •