Base | Representation |
---|---|
bin | 11110101101001101001… |
… | …111101100001001000000 |
3 | 21110201121020021110012110 |
4 | 132231031033230021000 |
5 | 234033013433312203 |
6 | 4253213351455320 |
7 | 305310601501122 |
oct | 36551517541100 |
9 | 7421536243173 |
10 | 2110124900928 |
11 | 74399854a900 |
12 | 2a0b58687540 |
13 | 123ca38b2b45 |
14 | 741b84a7212 |
15 | 39d51047d03 |
hex | 1eb4d3ec240 |
2110124900928 has 336 divisors, whose sum is σ = 6581668685760. Its totient is φ = 594341130240.
The previous prime is 2110124900887. The next prime is 2110124900929. The reversal of 2110124900928 is 8290094210112.
It is a super-2 number, since 2×21101249009282 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2110124900929) 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, 23349526 + ... + 23439722.
It is an arithmetic number, because the mean of its divisors is an integer number (19588299660).
Almost surely, 22110124900928 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2110124900928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3290834342880).
2110124900928 is an abundant number, since it is smaller than the sum of its proper divisors (4471543784832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110124900928 is a wasteful number, since it uses less digits than its factorization.
2110124900928 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90306 (or 90285 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 39.
The spelling of 2110124900928 in words is "two trillion, one hundred ten billion, one hundred twenty-four million, nine hundred thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •