Base | Representation |
---|---|
bin | 1010000110101111111000… |
… | …11100110000111011011001 |
3 | 2220200102010102221101210222 |
4 | 11003113330130300323121 |
5 | 10403041330403033311 |
6 | 115132405315045425 |
7 | 4452331245531566 |
oct | 503277434607331 |
9 | 86612112841728 |
10 | 22222101221081 |
11 | 70983818a0593 |
12 | 25aa9608a0875 |
13 | c526c5969788 |
14 | 56b7ac19b86d |
15 | 2880ab75cadb |
hex | 1435fc730ed9 |
22222101221081 has 2 divisors, whose sum is σ = 22222101221082. Its totient is φ = 22222101221080.
The previous prime is 22222101221071. The next prime is 22222101221123. The reversal of 22222101221081 is 18012210122222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20622088734025 + 1600012487056 = 4541155^2 + 1264916^2 .
It is a cyclic number.
It is not a de Polignac number, because 22222101221081 - 210 = 22222101220057 is a prime.
It is a super-2 number, since 2×222221012210812 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22222101221081.
It is not a weakly prime, because it can be changed into another prime (22222101221041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11111050610540 + 11111050610541.
It is an arithmetic number, because the mean of its divisors is an integer number (11111050610541).
Almost surely, 222222101221081 is an apocalyptic number.
It is an amenable number.
22222101221081 is a deficient number, since it is larger than the sum of its proper divisors (1).
22222101221081 is an equidigital number, since it uses as much as digits as its factorization.
22222101221081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1024, while the sum is 26.
The spelling of 22222101221081 in words is "twenty-two trillion, two hundred twenty-two billion, one hundred one million, two hundred twenty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •