Base | Representation |
---|---|
bin | 1100000110110100110111… |
… | …1111000101011011111001 |
3 | 1202010120002012011220122121 |
4 | 3001231031333011123321 |
5 | 3221043232440031043 |
6 | 44151102301121241 |
7 | 2542501125250054 |
oct | 301551577053371 |
9 | 52116065156577 |
10 | 13311412033273 |
11 | 427237a079552 |
12 | 15aba10b59221 |
13 | 757350ba7123 |
14 | 3403c0a51a9b |
15 | 1813d8b73ded |
hex | c1b4dfc56f9 |
13311412033273 has 2 divisors, whose sum is σ = 13311412033274. Its totient is φ = 13311412033272.
The previous prime is 13311412033237. The next prime is 13311412033279. The reversal of 13311412033273 is 37233021411331.
Together with previous prime (13311412033237) 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., 11900098921104 + 1411313112169 = 3449652^2 + 1187987^2 .
It is an emirp because it is prime and its reverse (37233021411331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13311412033273 is a prime.
It is not a weakly prime, because it can be changed into another prime (13311412033279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655706016636 + 6655706016637.
It is an arithmetic number, because the mean of its divisors is an integer number (6655706016637).
Almost surely, 213311412033273 is an apocalyptic number.
It is an amenable number.
13311412033273 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311412033273 is an equidigital number, since it uses as much as digits as its factorization.
13311412033273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27216, while the sum is 34.
The spelling of 13311412033273 in words is "thirteen trillion, three hundred eleven billion, four hundred twelve million, thirty-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.232 sec. • engine limits •