Base | Representation |
---|---|
bin | 1100000110110100011101… |
… | …1000010111111010100001 |
3 | 1202010112210110200010020012 |
4 | 3001231013120113322201 |
5 | 3221043021103101144 |
6 | 44151043302054305 |
7 | 2542465311336215 |
oct | 301550730277241 |
9 | 52115713603205 |
10 | 13311301222049 |
11 | 4272322573426 |
12 | 15ab99ba1a395 |
13 | 757333c4975c |
14 | 3403b0048945 |
15 | 1813ce085e9e |
hex | c1b47617ea1 |
13311301222049 has 2 divisors, whose sum is σ = 13311301222050. Its totient is φ = 13311301222048.
The previous prime is 13311301222033. The next prime is 13311301222123. The reversal of 13311301222049 is 94022210311331.
13311301222049 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11366796475024 + 1944504747025 = 3371468^2 + 1394455^2 .
It is an emirp because it is prime and its reverse (94022210311331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13311301222049 - 24 = 13311301222033 is a prime.
It is not a weakly prime, because it can be changed into another prime (13311301222019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655650611024 + 6655650611025.
It is an arithmetic number, because the mean of its divisors is an integer number (6655650611025).
Almost surely, 213311301222049 is an apocalyptic number.
It is an amenable number.
13311301222049 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311301222049 is an equidigital number, since it uses as much as digits as its factorization.
13311301222049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 13311301222049 in words is "thirteen trillion, three hundred eleven billion, three hundred one million, two hundred twenty-two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •