Base | Representation |
---|---|
bin | 110100010000011010… |
… | …1011001111011000101 |
3 | 101201122210202200212122 |
4 | 1220200311121323011 |
5 | 3314311311123141 |
6 | 123315252255325 |
7 | 11051626302125 |
oct | 1504065317305 |
9 | 351583680778 |
10 | 112220020421 |
11 | 43657304333 |
12 | 198ba311545 |
13 | a77541b062 |
14 | 5607d92c85 |
15 | 2dbbe6b64b |
hex | 1a20d59ec5 |
112220020421 has 2 divisors, whose sum is σ = 112220020422. Its totient is φ = 112220020420.
The previous prime is 112220020331. The next prime is 112220020439. The reversal of 112220020421 is 124020022211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93079297921 + 19140722500 = 305089^2 + 138350^2 .
It is an emirp because it is prime and its reverse (124020022211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112220020421 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112220020421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112220020021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56110010210 + 56110010211.
It is an arithmetic number, because the mean of its divisors is an integer number (56110010211).
Almost surely, 2112220020421 is an apocalyptic number.
It is an amenable number.
112220020421 is a deficient number, since it is larger than the sum of its proper divisors (1).
112220020421 is an equidigital number, since it uses as much as digits as its factorization.
112220020421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 112220020421 its reverse (124020022211), we get a palindrome (236240042632).
The spelling of 112220020421 in words is "one hundred twelve billion, two hundred twenty million, twenty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •