Base | Representation |
---|---|
bin | 1001001001000001011010… |
… | …00000011000111101000011 |
3 | 2122011122201022220220101121 |
4 | 10210200231000120331003 |
5 | 10113314230204202321 |
6 | 110430210440413111 |
7 | 4143156345020212 |
oct | 444405500307503 |
9 | 78148638826347 |
10 | 20101202022211 |
11 | 644a965560222 |
12 | 23078b7a77197 |
13 | b2a6c5b4520b |
14 | 4d6c90bb7079 |
15 | 24cd298aa441 |
hex | 12482d018f43 |
20101202022211 has 8 divisors (see below), whose sum is σ = 21159218883600. Its totient is φ = 19043191046880.
The previous prime is 20101202022197. The next prime is 20101202022217. The reversal of 20101202022211 is 11222020210102.
It is a happy number.
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 20101202022211 - 223 = 20101193633603 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20101202022217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6702681 + ... + 9226501.
It is an arithmetic number, because the mean of its divisors is an integer number (2644902360450).
Almost surely, 220101202022211 is an apocalyptic number.
20101202022211 is a deficient number, since it is larger than the sum of its proper divisors (1058016861389).
20101202022211 is a wasteful number, since it uses less digits than its factorization.
20101202022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2943029.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20101202022211 its reverse (11222020210102), we get a palindrome (31323222232313).
The spelling of 20101202022211 in words is "twenty trillion, one hundred one billion, two hundred two million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •