Base | Representation |
---|---|
bin | 1010000011001110010100… |
… | …10100001010001100110011 |
3 | 2220020211112202112210110011 |
4 | 11001213022110022030303 |
5 | 10344100322230121321 |
6 | 115001020521315351 |
7 | 4440513260025511 |
oct | 501471224121463 |
9 | 86224482483404 |
10 | 22101001020211 |
11 | 7050a889a4253 |
12 | 258b3a4635b57 |
13 | c44166861199 |
14 | 5659a0aa34b1 |
15 | 284d6edd1ae1 |
hex | 1419ca50a333 |
22101001020211 has 16 divisors (see below), whose sum is σ = 23371988629248. Its totient is φ = 20864963750400.
The previous prime is 22101001020187. The next prime is 22101001020221. The reversal of 22101001020211 is 11202010010122.
It is a cyclic number.
It is not a de Polignac number, because 22101001020211 - 27 = 22101001020083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22101001020191 and 22101001020200.
It is not an unprimeable number, because it can be changed into a prime (22101001020221) 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 15 ways as a sum of consecutive naturals, for example, 18030615 + ... + 19217311.
It is an arithmetic number, because the mean of its divisors is an integer number (1460749289328).
Almost surely, 222101001020211 is an apocalyptic number.
22101001020211 is a deficient number, since it is larger than the sum of its proper divisors (1270987609037).
22101001020211 is a wasteful number, since it uses less digits than its factorization.
22101001020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201422.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22101001020211 its reverse (11202010010122), we get a palindrome (33303011030333).
The spelling of 22101001020211 in words is "twenty-two trillion, one hundred one billion, one million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •