Base | Representation |
---|---|
bin | 11000101000010101… |
… | …11011001110010101 |
3 | 1021010112222202111201 |
4 | 30110022323032111 |
5 | 204040131411404 |
6 | 10024045232501 |
7 | 645454165603 |
oct | 142412731625 |
9 | 37115882451 |
10 | 13223310229 |
11 | 5676239768 |
12 | 2690562731 |
13 | 132972b02c |
14 | 8d6298873 |
15 | 525d62ca4 |
hex | 3142bb395 |
13223310229 has 2 divisors, whose sum is σ = 13223310230. Its totient is φ = 13223310228.
The previous prime is 13223310211. The next prime is 13223310239. The reversal of 13223310229 is 92201332231.
13223310229 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., 12950895204 + 272415025 = 113802^2 + 16505^2 .
It is a cyclic number.
It is not a de Polignac number, because 13223310229 - 221 = 13221213077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13223310197 and 13223310206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13223310239) 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, 6611655114 + 6611655115.
It is an arithmetic number, because the mean of its divisors is an integer number (6611655115).
Almost surely, 213223310229 is an apocalyptic number.
It is an amenable number.
13223310229 is a deficient number, since it is larger than the sum of its proper divisors (1).
13223310229 is an equidigital number, since it uses as much as digits as its factorization.
13223310229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 13223310229 in words is "thirteen billion, two hundred twenty-three million, three hundred ten thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •