Base | Representation |
---|---|
bin | 11000110001100010… |
… | …01100110011001001 |
3 | 1021022221010222212211 |
4 | 30120301030303021 |
5 | 204214403440203 |
6 | 10035442505121 |
7 | 650411660413 |
oct | 143061146311 |
9 | 37287128784 |
10 | 13300452553 |
11 | 5705838953 |
12 | 26b23651a1 |
13 | 133c6ca78b |
14 | 9026199b3 |
15 | 52c9eec6d |
hex | 318c4ccc9 |
13300452553 has 2 divisors, whose sum is σ = 13300452554. Its totient is φ = 13300452552.
The previous prime is 13300452547. The next prime is 13300452559. The reversal of 13300452553 is 35525400331.
It is a balanced prime because it is at equal distance from previous prime (13300452547) and next prime (13300452559).
It can be written as a sum of positive squares in only one way, i.e., 8336968249 + 4963484304 = 91307^2 + 70452^2 .
It is an emirp because it is prime and its reverse (35525400331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13300452553 - 221 = 13298355401 is a prime.
It is a super-2 number, since 2×133004525532 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13300452559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650226276 + 6650226277.
It is an arithmetic number, because the mean of its divisors is an integer number (6650226277).
Almost surely, 213300452553 is an apocalyptic number.
It is an amenable number.
13300452553 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300452553 is an equidigital number, since it uses as much as digits as its factorization.
13300452553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 31.
Adding to 13300452553 its reverse (35525400331), we get a palindrome (48825852884).
The spelling of 13300452553 in words is "thirteen billion, three hundred million, four hundred fifty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •