Base | Representation |
---|---|
bin | 1011110110100001000101… |
… | …0100011000000100110101 |
3 | 1201010202212012221102202112 |
4 | 2331220101110120010311 |
5 | 3202000420130031404 |
6 | 43414243242020405 |
7 | 2513321545464644 |
oct | 275502124300465 |
9 | 51122765842675 |
10 | 13031221330229 |
11 | 4174567799253 |
12 | 15656557a7705 |
13 | 736aba0a270b |
14 | 330a0075335b |
15 | 178e8a61156e |
hex | bda11518135 |
13031221330229 has 2 divisors, whose sum is σ = 13031221330230. Its totient is φ = 13031221330228.
The previous prime is 13031221330109. The next prime is 13031221330289. The reversal of 13031221330229 is 92203312213031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12834320580004 + 196900750225 = 3582502^2 + 443735^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13031221330229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13031221330195 and 13031221330204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13031221330289) 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, 6515610665114 + 6515610665115.
It is an arithmetic number, because the mean of its divisors is an integer number (6515610665115).
Almost surely, 213031221330229 is an apocalyptic number.
It is an amenable number.
13031221330229 is a deficient number, since it is larger than the sum of its proper divisors (1).
13031221330229 is an equidigital number, since it uses as much as digits as its factorization.
13031221330229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 13031221330229 in words is "thirteen trillion, thirty-one billion, two hundred twenty-one million, three hundred thirty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •