Base | Representation |
---|---|
bin | 1001001001000001001110… |
… | …00011010000011000000011 |
3 | 2122011122110100220211220011 |
4 | 10210200213003100120003 |
5 | 10113314024120011321 |
6 | 110430152511125351 |
7 | 4143154022542453 |
oct | 444404703203003 |
9 | 78148410824804 |
10 | 20101102110211 |
11 | 644a914119921 |
12 | 230788a513857 |
13 | b2a6ab2327a5 |
14 | 4d6c81809d63 |
15 | 24cd20c21ae1 |
hex | 1248270d0603 |
20101102110211 has 4 divisors (see below), whose sum is σ = 20355546440800. Its totient is φ = 19846657779624.
The previous prime is 20101102110191. The next prime is 20101102110251. The reversal of 20101102110211 is 11201120110102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20101102110211 - 27 = 20101102110083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20101102110191 and 20101102110200.
It is not an unprimeable number, because it can be changed into a prime (20101102110251) 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, 127222165176 + ... + 127222165333.
It is an arithmetic number, because the mean of its divisors is an integer number (5088886610200).
Almost surely, 220101102110211 is an apocalyptic number.
20101102110211 is a deficient number, since it is larger than the sum of its proper divisors (254444330589).
20101102110211 is an equidigital number, since it uses as much as digits as its factorization.
20101102110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254444330588.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20101102110211 its reverse (11201120110102), we get a palindrome (31302222220313).
The spelling of 20101102110211 in words is "twenty trillion, one hundred one billion, one hundred two million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •