Base | Representation |
---|---|
bin | 1010000110001000110011… |
… | …00000111111101110111001 |
3 | 2220121101221210211210012201 |
4 | 11003010121200333232321 |
5 | 10402220340143024311 |
6 | 115115015002510201 |
7 | 4450656205424554 |
oct | 503043140775671 |
9 | 86541853753181 |
10 | 22201114033081 |
11 | 708a4920a9615 |
12 | 25a6884205361 |
13 | c5072c8bc439 |
14 | 56a77ab4169b |
15 | 28777dee19c1 |
hex | 14311983fbb9 |
22201114033081 has 2 divisors, whose sum is σ = 22201114033082. Its totient is φ = 22201114033080.
The previous prime is 22201114033039. The next prime is 22201114033159. The reversal of 22201114033081 is 18033041110222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21750013743481 + 451100289600 = 4663691^2 + 671640^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22201114033081 is a prime.
It is a super-2 number, since 2×222011140330812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (22201114033781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11100557016540 + 11100557016541.
It is an arithmetic number, because the mean of its divisors is an integer number (11100557016541).
Almost surely, 222201114033081 is an apocalyptic number.
It is an amenable number.
22201114033081 is a deficient number, since it is larger than the sum of its proper divisors (1).
22201114033081 is an equidigital number, since it uses as much as digits as its factorization.
22201114033081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
The spelling of 22201114033081 in words is "twenty-two trillion, two hundred one billion, one hundred fourteen million, thirty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •