Base | Representation |
---|---|
bin | 1100000110001011100100… |
… | …0101101001010101010001 |
3 | 1202002111110110010010211122 |
4 | 3001202321011221111101 |
5 | 3220403030421412033 |
6 | 44142030130252025 |
7 | 2541626266526354 |
oct | 301427105512521 |
9 | 52074413103748 |
10 | 13300324013393 |
11 | 42686aa19205a |
12 | 15a9837727015 |
13 | 7562a4971c11 |
14 | 33da4c1cc29b |
15 | 180e8a4e9a98 |
hex | c18b9169551 |
13300324013393 has 2 divisors, whose sum is σ = 13300324013394. Its totient is φ = 13300324013392.
The previous prime is 13300324013357. The next prime is 13300324013477. The reversal of 13300324013393 is 39331042300331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8366625670144 + 4933698343249 = 2892512^2 + 2221193^2 .
It is a cyclic number.
It is not a de Polignac number, because 13300324013393 - 230 = 13299250271569 is a prime.
It is a super-2 number, since 2×133003240133932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13300324013693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650162006696 + 6650162006697.
It is an arithmetic number, because the mean of its divisors is an integer number (6650162006697).
Almost surely, 213300324013393 is an apocalyptic number.
It is an amenable number.
13300324013393 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300324013393 is an equidigital number, since it uses as much as digits as its factorization.
13300324013393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 35.
The spelling of 13300324013393 in words is "thirteen trillion, three hundred billion, three hundred twenty-four million, thirteen thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •