Base | Representation |
---|---|
bin | 1011111011000110111110… |
… | …0100110010010000010101 |
3 | 1201102022111020211211212011 |
4 | 2332301233210302100111 |
5 | 3204244002144221042 |
6 | 43514411413024221 |
7 | 2522113541125153 |
oct | 276615744622025 |
9 | 51368436754764 |
10 | 13110112101397 |
11 | 41a4a70557293 |
12 | 15789b2025071 |
13 | 741380474cbc |
14 | 33476606a3d3 |
15 | 17b056524a17 |
hex | bec6f932415 |
13110112101397 has 2 divisors, whose sum is σ = 13110112101398. Its totient is φ = 13110112101396.
The previous prime is 13110112101337. The next prime is 13110112101439. The reversal of 13110112101397 is 79310121101131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12955903523761 + 154208577636 = 3599431^2 + 392694^2 .
It is a cyclic number.
It is not a de Polignac number, because 13110112101397 - 27 = 13110112101269 is a prime.
It is a super-2 number, since 2×131101121013972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13110112101337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555056050698 + 6555056050699.
It is an arithmetic number, because the mean of its divisors is an integer number (6555056050699).
Almost surely, 213110112101397 is an apocalyptic number.
It is an amenable number.
13110112101397 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110112101397 is an equidigital number, since it uses as much as digits as its factorization.
13110112101397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 31.
The spelling of 13110112101397 in words is "thirteen trillion, one hundred ten billion, one hundred twelve million, one hundred one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •