Base | Representation |
---|---|
bin | 11000110011000010… |
… | …01001010100010001 |
3 | 1021100210210112211022 |
4 | 30121201021110101 |
5 | 204231113134301 |
6 | 10041012125225 |
7 | 650623545614 |
oct | 143141112421 |
9 | 37323715738 |
10 | 13313021201 |
11 | 5711942967 |
12 | 26b6606815 |
13 | 13421ab54c |
14 | 90416c17b |
15 | 52db83d1b |
hex | 319849511 |
13313021201 has 2 divisors, whose sum is σ = 13313021202. Its totient is φ = 13313021200.
The previous prime is 13313021159. The next prime is 13313021219. The reversal of 13313021201 is 10212031331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13294090000 + 18931201 = 115300^2 + 4351^2 .
It is an emirp because it is prime and its reverse (10212031331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13313021201 - 210 = 13313020177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13313021201.
It is not a weakly prime, because it can be changed into another prime (13313021221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6656510600 + 6656510601.
It is an arithmetic number, because the mean of its divisors is an integer number (6656510601).
Almost surely, 213313021201 is an apocalyptic number.
It is an amenable number.
13313021201 is a deficient number, since it is larger than the sum of its proper divisors (1).
13313021201 is an equidigital number, since it uses as much as digits as its factorization.
13313021201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13313021201 its reverse (10212031331), we get a palindrome (23525052532).
The spelling of 13313021201 in words is "thirteen billion, three hundred thirteen million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •