Base | Representation |
---|---|
bin | 1001001001000011000111… |
… | …10110010010011110010111 |
3 | 2122011202002110020202210122 |
4 | 10210201203312102132113 |
5 | 10113323121230333421 |
6 | 110430442025342155 |
7 | 4143221216516252 |
oct | 444414366223627 |
9 | 78152073222718 |
10 | 20102122121111 |
11 | 6450297970138 |
12 | 2307b1403795b |
13 | b2a811658034 |
14 | 4d6d3b086099 |
15 | 24cd805572ab |
hex | 124863d92797 |
20102122121111 has 4 divisors (see below), whose sum is σ = 20103405715224. Its totient is φ = 20100838527000.
The previous prime is 20102122121087. The next prime is 20102122121171. The reversal of 20102122121111 is 11112122120102.
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 20102122121111 - 26 = 20102122121047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20102122121111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102122121171) 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, 641773565 + ... + 641804886.
It is an arithmetic number, because the mean of its divisors is an integer number (5025851428806).
Almost surely, 220102122121111 is an apocalyptic number.
20102122121111 is a deficient number, since it is larger than the sum of its proper divisors (1283594113).
20102122121111 is a wasteful number, since it uses less digits than its factorization.
20102122121111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1283594112.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 20102122121111 its reverse (11112122120102), we get a palindrome (31214244241213).
The spelling of 20102122121111 in words is "twenty trillion, one hundred two billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •