Base | Representation |
---|---|
bin | 1010000011110011110000… |
… | …10111111010111110100001 |
3 | 2220022202102120102012201121 |
4 | 11001321320113322332201 |
5 | 10344413003341024301 |
6 | 115014143224132241 |
7 | 4442124336004051 |
oct | 501717027727641 |
9 | 86282376365647 |
10 | 22121101111201 |
11 | 70595629770a4 |
12 | 2593274007081 |
13 | c4601abb1b51 |
14 | 56694a3a1561 |
15 | 28564981e3a1 |
hex | 141e785fafa1 |
22121101111201 has 8 divisors (see below), whose sum is σ = 22496137423200. Its totient is φ = 21746068212480.
The previous prime is 22121101111177. The next prime is 22121101111211. The reversal of 22121101111201 is 10211110112122.
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 22121101111201 - 243 = 13325008088993 is a prime.
It is a super-2 number, since 2×221211011112012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22121101111211) 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, 14557746 + ... + 16005316.
It is an arithmetic number, because the mean of its divisors is an integer number (2812017177900).
Almost surely, 222121101111201 is an apocalyptic number.
It is an amenable number.
22121101111201 is a deficient number, since it is larger than the sum of its proper divisors (375036311999).
22121101111201 is a wasteful number, since it uses less digits than its factorization.
22121101111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1706639.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 22121101111201 its reverse (10211110112122), we get a palindrome (32332211223323).
The spelling of 22121101111201 in words is "twenty-two trillion, one hundred twenty-one billion, one hundred one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •