Base | Representation |
---|---|
bin | 1010000110011101010000… |
… | …11001000001100111000101 |
3 | 2220122110022111210112222220 |
4 | 11003032220121001213011 |
5 | 10402410340330120401 |
6 | 115124033124042553 |
7 | 4451525366321646 |
oct | 503165031014705 |
9 | 86573274715886 |
10 | 22212101020101 |
11 | 709410aa59583 |
12 | 25a8a2b833459 |
13 | c51790c0b9a5 |
14 | 56b0dddc56cd |
15 | 287bc3860336 |
hex | 1433a86419c5 |
22212101020101 has 8 divisors (see below), whose sum is σ = 31358260263744. Its totient is φ = 13937004561600.
The previous prime is 22212101020091. The next prime is 22212101020177. The reversal of 22212101020101 is 10102010121222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22212101020101 - 27 = 22212101019973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22212101020301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 217765696225 + ... + 217765696326.
It is an arithmetic number, because the mean of its divisors is an integer number (3919782532968).
Almost surely, 222212101020101 is an apocalyptic number.
It is an amenable number.
22212101020101 is a deficient number, since it is larger than the sum of its proper divisors (9146159243643).
22212101020101 is a wasteful number, since it uses less digits than its factorization.
22212101020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435531392571.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22212101020101 its reverse (10102010121222), we get a palindrome (32314111141323).
The spelling of 22212101020101 in words is "twenty-two trillion, two hundred twelve billion, one hundred one million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •