Base | Representation |
---|---|
bin | 11000011001101001… |
… | …00100101000011101 |
3 | 1020210221222110102001 |
4 | 30030310210220131 |
5 | 203312100310023 |
6 | 10003522402301 |
7 | 642426151006 |
oct | 141464445035 |
9 | 36727873361 |
10 | 13100010013 |
11 | 5612683462 |
12 | 2657200391 |
13 | 130a019c1c |
14 | 8c3b601ad |
15 | 51a1096ad |
hex | 30cd24a1d |
13100010013 has 2 divisors, whose sum is σ = 13100010014. Its totient is φ = 13100010012.
The previous prime is 13100009981. The next prime is 13100010037. The reversal of 13100010013 is 31001000131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13077523449 + 22486564 = 114357^2 + 4742^2 .
It is a cyclic number.
It is not a de Polignac number, because 13100010013 - 25 = 13100009981 is a prime.
It is a super-2 number, since 2×131000100132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13100410013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550005006 + 6550005007.
It is an arithmetic number, because the mean of its divisors is an integer number (6550005007).
Almost surely, 213100010013 is an apocalyptic number.
It is an amenable number.
13100010013 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100010013 is an equidigital number, since it uses as much as digits as its factorization.
13100010013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 13100010013 its reverse (31001000131), we get a palindrome (44101010144).
The spelling of 13100010013 in words is "thirteen billion, one hundred million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.583 sec. • engine limits •