Base | Representation |
---|---|
bin | 1100000001100000110000… |
… | …0101011110101100011001 |
3 | 1201210211102100020202110222 |
4 | 3000120030011132230121 |
5 | 3213044242144200441 |
6 | 44041122522445425 |
7 | 2533056462521663 |
oct | 300301405365431 |
9 | 51724370222428 |
10 | 13220112100121 |
11 | 42376886a6443 |
12 | 1596190963875 |
13 | 74b860971444 |
14 | 339bdd24d533 |
15 | 17dd4361bd4b |
hex | c060c15eb19 |
13220112100121 has 2 divisors, whose sum is σ = 13220112100122. Its totient is φ = 13220112100120.
The previous prime is 13220112100093. The next prime is 13220112100141. The reversal of 13220112100121 is 12100121102231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8508451455625 + 4711660644496 = 2916925^2 + 2170636^2 .
It is a cyclic number.
It is not a de Polignac number, because 13220112100121 - 210 = 13220112099097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13220112100121.
It is not a weakly prime, because it can be changed into another prime (13220112100141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6610056050060 + 6610056050061.
It is an arithmetic number, because the mean of its divisors is an integer number (6610056050061).
Almost surely, 213220112100121 is an apocalyptic number.
It is an amenable number.
13220112100121 is a deficient number, since it is larger than the sum of its proper divisors (1).
13220112100121 is an equidigital number, since it uses as much as digits as its factorization.
13220112100121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 13220112100121 its reverse (12100121102231), we get a palindrome (25320233202352).
The spelling of 13220112100121 in words is "thirteen trillion, two hundred twenty billion, one hundred twelve million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •