Base | Representation |
---|---|
bin | 1001001001000011000101… |
… | …00110100001011110000011 |
3 | 2122011202000222220102112111 |
4 | 10210201202212201132003 |
5 | 10113323100402223021 |
6 | 110430440001240151 |
7 | 4143220544010001 |
oct | 444414246413603 |
9 | 78152028812474 |
10 | 20102101211011 |
11 | 6450287089066 |
12 | 2307b09033057 |
13 | b2a80a2165b1 |
14 | 4d6d383a1a71 |
15 | 24cd7d7c68e1 |
hex | 1248629a1783 |
20102101211011 has 8 divisors (see below), whose sum is σ = 20111176834560. Its totient is φ = 20093027520072.
The previous prime is 20102101210981. The next prime is 20102101211029. The reversal of 20102101211011 is 11011210120102.
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 a de Polignac number, because none of the positive numbers 2k-20102101211011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20102101210982 and 20102101211000.
It is not an unprimeable number, because it can be changed into a prime (20102101211711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20530356 + ... + 21487198.
It is an arithmetic number, because the mean of its divisors is an integer number (2513897104320).
Almost surely, 220102101211011 is an apocalyptic number.
20102101211011 is a deficient number, since it is larger than the sum of its proper divisors (9075623549).
20102101211011 is an equidigital number, since it uses as much as digits as its factorization.
20102101211011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 966305.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20102101211011 its reverse (11011210120102), we get a palindrome (31113311331113).
The spelling of 20102101211011 in words is "twenty trillion, one hundred two billion, one hundred one million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •