Base | Representation |
---|---|
bin | 1100000110110100000101… |
… | …0111110011100111110111 |
3 | 1202010112112102222100020102 |
4 | 3001231001113303213313 |
5 | 3221042314301110403 |
6 | 44151025301224315 |
7 | 2542462645422641 |
oct | 301550127634767 |
9 | 52115472870212 |
10 | 13311200410103 |
11 | 4272280677972 |
12 | 15ab97210209b |
13 | 7573190b050b |
14 | 3403a08c5891 |
15 | 1813c52c0b88 |
hex | c1b415f39f7 |
13311200410103 has 2 divisors, whose sum is σ = 13311200410104. Its totient is φ = 13311200410102.
The previous prime is 13311200410031. The next prime is 13311200410133. The reversal of 13311200410103 is 30101400211331.
Together with previous prime (13311200410031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13311200410103 - 226 = 13311133301239 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13311200410133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655600205051 + 6655600205052.
It is an arithmetic number, because the mean of its divisors is an integer number (6655600205052).
Almost surely, 213311200410103 is an apocalyptic number.
13311200410103 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311200410103 is an equidigital number, since it uses as much as digits as its factorization.
13311200410103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13311200410103 its reverse (30101400211331), we get a palindrome (43412600621434).
The spelling of 13311200410103 in words is "thirteen trillion, three hundred eleven billion, two hundred million, four hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •