Base | Representation |
---|---|
bin | 11000011010111101… |
… | …11000011110000101 |
3 | 1020211201211221211002 |
4 | 30031132320132011 |
5 | 203322420220232 |
6 | 10005000223045 |
7 | 642622344116 |
oct | 141536703605 |
9 | 36751757732 |
10 | 13111101317 |
11 | 5618969526 |
12 | 265aa6aa85 |
13 | 130c401422 |
14 | 8c540a20d |
15 | 51b09ab62 |
hex | 30d7b8785 |
13111101317 has 2 divisors, whose sum is σ = 13111101318. Its totient is φ = 13111101316.
The previous prime is 13111101251. The next prime is 13111101337. The reversal of 13111101317 is 71310111131.
It is an a-pointer prime, because the next prime (13111101337) can be obtained adding 13111101317 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12938152516 + 172948801 = 113746^2 + 13151^2 .
It is a cyclic number.
It is not a de Polignac number, because 13111101317 - 210 = 13111100293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13111101337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555550658 + 6555550659.
It is an arithmetic number, because the mean of its divisors is an integer number (6555550659).
Almost surely, 213111101317 is an apocalyptic number.
It is an amenable number.
13111101317 is a deficient number, since it is larger than the sum of its proper divisors (1).
13111101317 is an equidigital number, since it uses as much as digits as its factorization.
13111101317 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 63, while the sum is 20.
Adding to 13111101317 its reverse (71310111131), we get a palindrome (84421212448).
The spelling of 13111101317 in words is "thirteen billion, one hundred eleven million, one hundred one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •