Base | Representation |
---|---|
bin | 11000011001101001… |
… | …00100101101010011 |
3 | 1020210221222110211112 |
4 | 30030310210231103 |
5 | 203312100312243 |
6 | 10003522403535 |
7 | 642426151631 |
oct | 141464445523 |
9 | 36727873745 |
10 | 13100010323 |
11 | 5612683714 |
12 | 26572005ab |
13 | 130a01a0ca |
14 | 8c3b60351 |
15 | 51a109818 |
hex | 30cd24b53 |
13100010323 has 2 divisors, whose sum is σ = 13100010324. Its totient is φ = 13100010322.
The previous prime is 13100010299. The next prime is 13100010337. The reversal of 13100010323 is 32301000131.
It is an a-pointer prime, because the next prime (13100010337) can be obtained adding 13100010323 to its sum of digits (14).
It is a strong prime.
It is an emirp because it is prime and its reverse (32301000131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13100010323 is a prime.
It is a super-2 number, since 2×131000103232 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 13100010298 and 13100010307.
It is not a weakly prime, because it can be changed into another prime (13100010353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550005161 + 6550005162.
It is an arithmetic number, because the mean of its divisors is an integer number (6550005162).
Almost surely, 213100010323 is an apocalyptic number.
13100010323 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100010323 is an equidigital number, since it uses as much as digits as its factorization.
13100010323 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 13100010323 its reverse (32301000131), we get a palindrome (45401010454).
The spelling of 13100010323 in words is "thirteen billion, one hundred million, ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •