Base | Representation |
---|---|
bin | 10100101011010010… |
… | …001101010111011111 |
3 | 2010022020011011221111 |
4 | 110223102031113133 |
5 | 330431430430421 |
6 | 14110553042451 |
7 | 1414106433211 |
oct | 245322152737 |
9 | 63266134844 |
10 | 22201030111 |
11 | 94629a2577 |
12 | 43770b6427 |
13 | 212a6aa110 |
14 | 11087505b1 |
15 | 89e0dcee1 |
hex | 52b48d5df |
22201030111 has 8 divisors (see below), whose sum is σ = 25167159920. Its totient is φ = 19414665792.
The previous prime is 22201030097. The next prime is 22201030151. The reversal of 22201030111 is 11103010222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22201030111 - 211 = 22201028063 is a prime.
It is a super-3 number, since 3×222010301113 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22201030091 and 22201030100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22201030151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44941110 + ... + 44941603.
It is an arithmetic number, because the mean of its divisors is an integer number (3145894990).
Almost surely, 222201030111 is an apocalyptic number.
22201030111 is a deficient number, since it is larger than the sum of its proper divisors (2966129809).
22201030111 is a wasteful number, since it uses less digits than its factorization.
22201030111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89882745.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 22201030111 its reverse (11103010222), we get a palindrome (33304040333).
The spelling of 22201030111 in words is "twenty-two billion, two hundred one million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •