Base | Representation |
---|---|
bin | 1011111100110111011100… |
… | …1110110010101111100101 |
3 | 1201112012102110201112020002 |
4 | 2333031313032302233211 |
5 | 3210242321130400104 |
6 | 43540323430351045 |
7 | 2524233005236211 |
oct | 277156716625745 |
9 | 51465373645202 |
10 | 13140305325029 |
11 | 4206854875073 |
12 | 15828197bb485 |
13 | 744182890bbc |
14 | 335dcc011941 |
15 | 17bc220ba01e |
hex | bf3773b2be5 |
13140305325029 has 2 divisors, whose sum is σ = 13140305325030. Its totient is φ = 13140305325028.
The previous prime is 13140305324987. The next prime is 13140305325053. The reversal of 13140305325029 is 92052350304131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9997832944225 + 3142472380804 = 3161935^2 + 1772702^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13140305325029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13140305324983 and 13140305325001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13140305322029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6570152662514 + 6570152662515.
It is an arithmetic number, because the mean of its divisors is an integer number (6570152662515).
Almost surely, 213140305325029 is an apocalyptic number.
It is an amenable number.
13140305325029 is a deficient number, since it is larger than the sum of its proper divisors (1).
13140305325029 is an equidigital number, since it uses as much as digits as its factorization.
13140305325029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 38.
The spelling of 13140305325029 in words is "thirteen trillion, one hundred forty billion, three hundred five million, three hundred twenty-five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •