Base | Representation |
---|---|
bin | 1011111011000110111011… |
… | …0110110001111011000101 |
3 | 1201102022110102011010200002 |
4 | 2332301232312301323011 |
5 | 3204243441102311123 |
6 | 43514410302331045 |
7 | 2522113333455644 |
oct | 276615666617305 |
9 | 51368412133602 |
10 | 13110100041413 |
11 | 41a4a6476a461 |
12 | 15789a9b89a85 |
13 | 74137ab1190b |
14 | 33476460b35b |
15 | 17b055441528 |
hex | bec6edb1ec5 |
13110100041413 has 2 divisors, whose sum is σ = 13110100041414. Its totient is φ = 13110100041412.
The previous prime is 13110100041323. The next prime is 13110100041431. The reversal of 13110100041413 is 31414000101131.
Together with next prime (13110100041431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6844800690049 + 6265299351364 = 2616257^2 + 2503058^2 .
It is a cyclic number.
It is not a de Polignac number, because 13110100041413 - 222 = 13110095847109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13110100041433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555050020706 + 6555050020707.
It is an arithmetic number, because the mean of its divisors is an integer number (6555050020707).
Almost surely, 213110100041413 is an apocalyptic number.
It is an amenable number.
13110100041413 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110100041413 is an equidigital number, since it uses as much as digits as its factorization.
13110100041413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13110100041413 its reverse (31414000101131), we get a palindrome (44524100142544).
The spelling of 13110100041413 in words is "thirteen trillion, one hundred ten billion, one hundred million, forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •