Base | Representation |
---|---|
bin | 11110100011110111110… |
… | …101110001101101000110 |
3 | 21102202201201121220211110 |
4 | 132203313311301231012 |
5 | 233402002120010042 |
6 | 4244435032345450 |
7 | 304504326254310 |
oct | 36436765615506 |
9 | 7382651556743 |
10 | 2100102110022 |
11 | 73a714989734 |
12 | 29b01bb45286 |
13 | 123067275b37 |
14 | 739072d07b0 |
15 | 3996618709c |
hex | 1e8f7d71b46 |
2100102110022 has 96 divisors (see below), whose sum is σ = 4962194984448. Its totient is φ = 580382748288.
The previous prime is 2100102110021. The next prime is 2100102110033. The reversal of 2100102110022 is 2200112010012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100102110021) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7867498 + ... + 8130050.
It is an arithmetic number, because the mean of its divisors is an integer number (51689531088).
Almost surely, 22100102110022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2100102110022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2481097492224).
2100102110022 is an abundant number, since it is smaller than the sum of its proper divisors (2862092874426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2100102110022 is a wasteful number, since it uses less digits than its factorization.
2100102110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262754 (or 262711 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2100102110022 its reverse (2200112010012), we get a palindrome (4300214120034).
The spelling of 2100102110022 in words is "two trillion, one hundred billion, one hundred two million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •