Base | Representation |
---|---|
bin | 11000011100101010… |
… | …00011101110111101 |
3 | 1020212201120111011211 |
4 | 30032111003232331 |
5 | 203340034200404 |
6 | 10010224444421 |
7 | 643154144113 |
oct | 141625035675 |
9 | 36781514154 |
10 | 13125303229 |
11 | 5625989645 |
12 | 2663779711 |
13 | 131233471c |
14 | 8c7265ab3 |
15 | 51c453b04 |
hex | 30e543bbd |
13125303229 has 2 divisors, whose sum is σ = 13125303230. Its totient is φ = 13125303228.
The previous prime is 13125303193. The next prime is 13125303251. The reversal of 13125303229 is 92230352131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12182199129 + 943104100 = 110373^2 + 30710^2 .
It is an emirp because it is prime and its reverse (92230352131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13125303229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13125303229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13125304229) 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, 6562651614 + 6562651615.
It is an arithmetic number, because the mean of its divisors is an integer number (6562651615).
Almost surely, 213125303229 is an apocalyptic number.
It is an amenable number.
13125303229 is a deficient number, since it is larger than the sum of its proper divisors (1).
13125303229 is an equidigital number, since it uses as much as digits as its factorization.
13125303229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 31.
The spelling of 13125303229 in words is "thirteen billion, one hundred twenty-five million, three hundred three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •