Base | Representation |
---|---|
bin | 1001001001000011000111… |
… | …10110101000001100111111 |
3 | 2122011202002110102021212221 |
4 | 10210201203312220030333 |
5 | 10113323121241210421 |
6 | 110430442031310211 |
7 | 4143221220336604 |
oct | 444414366501477 |
9 | 78152073367787 |
10 | 20102122210111 |
11 | 6450297a20a97 |
12 | 2307b1407b367 |
13 | b2a8116896b6 |
14 | 4d6d3b0aa6ab |
15 | 24cd80573841 |
hex | 124863da833f |
20102122210111 has 8 divisors (see below), whose sum is σ = 20587632115248. Its totient is φ = 19621643496000.
The previous prime is 20102122210097. The next prime is 20102122210123. The reversal of 20102122210111 is 11101222120102.
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 20102122210111 - 29 = 20102122209599 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102122210211) 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, 1257789670 + ... + 1257805651.
It is an arithmetic number, because the mean of its divisors is an integer number (2573454014406).
Almost surely, 220102122210111 is an apocalyptic number.
20102122210111 is a deficient number, since it is larger than the sum of its proper divisors (485509905137).
20102122210111 is a wasteful number, since it uses less digits than its factorization.
20102122210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2515595513.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20102122210111 its reverse (11101222120102), we get a palindrome (31203344330213).
Subtracting from 20102122210111 its reverse (11101222120102), we obtain a palindrome (9000900090009).
The spelling of 20102122210111 in words is "twenty trillion, one hundred two billion, one hundred twenty-two million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •