Base | Representation |
---|---|
bin | 1011110101011101001100… |
… | …1111111100100001011101 |
3 | 1201002000211100111122200022 |
4 | 2331113103033330201131 |
5 | 3201201111012042341 |
6 | 43402031214041525 |
7 | 2512105162624244 |
oct | 275272317744135 |
9 | 51060740448608 |
10 | 13013000112221 |
11 | 416786735149a |
12 | 156200b4a92a5 |
13 | 735175099205 |
14 | 32db927bd95b |
15 | 178770b0be4b |
hex | bd5d33fc85d |
13013000112221 has 2 divisors, whose sum is σ = 13013000112222. Its totient is φ = 13013000112220.
The previous prime is 13013000112173. The next prime is 13013000112337. The reversal of 13013000112221 is 12221100031031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11440832704900 + 1572167407321 = 3382430^2 + 1253861^2 .
It is a cyclic number.
It is not a de Polignac number, because 13013000112221 - 218 = 13012999850077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13013000112221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13013000142221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6506500056110 + 6506500056111.
It is an arithmetic number, because the mean of its divisors is an integer number (6506500056111).
Almost surely, 213013000112221 is an apocalyptic number.
It is an amenable number.
13013000112221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13013000112221 is an equidigital number, since it uses as much as digits as its factorization.
13013000112221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 13013000112221 its reverse (12221100031031), we get a palindrome (25234100143252).
The spelling of 13013000112221 in words is "thirteen trillion, thirteen billion, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •