Base | Representation |
---|---|
bin | 1010000000110111110110… |
… | …11101101000110111111111 |
3 | 2212222010001002002021002122 |
4 | 11000123323131220313333 |
5 | 10341234403112210421 |
6 | 114455541105513155 |
7 | 4431623416000205 |
oct | 500337335506777 |
9 | 85863032067078 |
10 | 22020221210111 |
11 | 701a7a5897313 |
12 | 25777bb6427bb |
13 | c39661cc5197 |
14 | 561ada537075 |
15 | 282be32282ab |
hex | 1406fb768dff |
22020221210111 has 8 divisors (see below), whose sum is σ = 22549559159424. Its totient is φ = 21491666887320.
The previous prime is 22020221210081. The next prime is 22020221210123. The reversal of 22020221210111 is 11101212202022.
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 22020221210111 - 234 = 22003041340927 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22020221210111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22020221210161) 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, 195849755 + ... + 195962156.
It is an arithmetic number, because the mean of its divisors is an integer number (2818694894928).
Almost surely, 222020221210111 is an apocalyptic number.
22020221210111 is a deficient number, since it is larger than the sum of its proper divisors (529337949313).
22020221210111 is a wasteful number, since it uses less digits than its factorization.
22020221210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 391813261.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 22020221210111 its reverse (11101212202022), we get a palindrome (33121433412133).
The spelling of 22020221210111 in words is "twenty-two trillion, twenty billion, two hundred twenty-one million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •