Base | Representation |
---|---|
bin | 1010000011001110100001… |
… | …11000001000010110000001 |
3 | 2220020211211102201002111011 |
4 | 11001213100320020112001 |
5 | 10344101033421104324 |
6 | 115001035453120521 |
7 | 4440516064555141 |
oct | 501472070102601 |
9 | 86224742632434 |
10 | 22101111113089 |
11 | 70510350596a8 |
12 | 258b415489141 |
13 | c441835c98b8 |
14 | 5659b1560921 |
15 | 284d798cbc94 |
hex | 1419d0e08581 |
22101111113089 has 2 divisors, whose sum is σ = 22101111113090. Its totient is φ = 22101111113088.
The previous prime is 22101111113077. The next prime is 22101111113111. The reversal of 22101111113089 is 98031111110122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19109968535025 + 2991142578064 = 4371495^2 + 1729492^2 .
It is a cyclic number.
It is not a de Polignac number, because 22101111113089 - 25 = 22101111113057 is a prime.
It is a super-2 number, since 2×221011111130892 (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 22101111113089.
It is not a weakly prime, because it can be changed into another prime (22101111113989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11050555556544 + 11050555556545.
It is an arithmetic number, because the mean of its divisors is an integer number (11050555556545).
Almost surely, 222101111113089 is an apocalyptic number.
It is an amenable number.
22101111113089 is a deficient number, since it is larger than the sum of its proper divisors (1).
22101111113089 is an equidigital number, since it uses as much as digits as its factorization.
22101111113089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 31.
The spelling of 22101111113089 in words is "twenty-two trillion, one hundred one billion, one hundred eleven million, one hundred thirteen thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •