Base | Representation |
---|---|
bin | 11000101000010111… |
… | …01010010111001101 |
3 | 1021010120100120100211 |
4 | 30110023222113031 |
5 | 204040204101214 |
6 | 10024053322421 |
7 | 645455631532 |
oct | 142413522715 |
9 | 37116316324 |
10 | 13223503309 |
11 | 5676360835 |
12 | 2690636411 |
13 | 1329797b93 |
14 | 8d6308d89 |
15 | 525da00c4 |
hex | 3142ea5cd |
13223503309 has 2 divisors, whose sum is σ = 13223503310. Its totient is φ = 13223503308.
The previous prime is 13223503277. The next prime is 13223503333. The reversal of 13223503309 is 90330532231.
13223503309 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12382793284 + 840710025 = 111278^2 + 28995^2 .
It is a cyclic number.
It is not a de Polignac number, because 13223503309 - 25 = 13223503277 is a prime.
It is a super-2 number, since 2×132235033092 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13223503399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6611751654 + 6611751655.
It is an arithmetic number, because the mean of its divisors is an integer number (6611751655).
Almost surely, 213223503309 is an apocalyptic number.
It is an amenable number.
13223503309 is a deficient number, since it is larger than the sum of its proper divisors (1).
13223503309 is an equidigital number, since it uses as much as digits as its factorization.
13223503309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 31.
The spelling of 13223503309 in words is "thirteen billion, two hundred twenty-three million, five hundred three thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •