Base | Representation |
---|---|
bin | 1010000011001100110101… |
… | …01100001110000011101101 |
3 | 2220020202111002002102201112 |
4 | 11001212122230032003231 |
5 | 10344042203204133401 |
6 | 115000405340121405 |
7 | 4440454415451161 |
oct | 501463254160355 |
9 | 86222432072645 |
10 | 22100202021101 |
11 | 7050708987406 |
12 | 258b200b36265 |
13 | c4406a16ba49 |
14 | 565926918ca1 |
15 | 284d24ba63bb |
hex | 14199ab0e0ed |
22100202021101 has 4 divisors (see below), whose sum is σ = 22178294608032. Its totient is φ = 22022109434172.
The previous prime is 22100202021041. The next prime is 22100202021137. The reversal of 22100202021101 is 10112020200122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22100202021101 - 226 = 22100134912237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22100202021701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39046293041 + ... + 39046293606.
It is an arithmetic number, because the mean of its divisors is an integer number (5544573652008).
Almost surely, 222100202021101 is an apocalyptic number.
It is an amenable number.
22100202021101 is a deficient number, since it is larger than the sum of its proper divisors (78092586931).
22100202021101 is an equidigital number, since it uses as much as digits as its factorization.
22100202021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78092586930.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 22100202021101 its reverse (10112020200122), we get a palindrome (32212222221223).
The spelling of 22100202021101 in words is "twenty-two trillion, one hundred billion, two hundred two million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •