Base | Representation |
---|---|
bin | 1001001100011111001000… |
… | …1111001101011100010110 |
3 | 1022210111222210102121200210 |
4 | 2103013302033031130112 |
5 | 2311121012230332412 |
6 | 33300305340150250 |
7 | 2062301152051512 |
oct | 223076217153426 |
9 | 38714883377623 |
10 | 10110122120982 |
11 | 3248751404464 |
12 | 11734ab538386 |
13 | 5844c3a42860 |
14 | 26d492621142 |
15 | 127ec2b0e83c |
hex | 931f23cd716 |
10110122120982 has 128 divisors (see below), whose sum is σ = 23155470051840. Its totient is φ = 2917074954240.
The previous prime is 10110122120939. The next prime is 10110122120983. The reversal of 10110122120982 is 28902122101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110122120983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 192323982 + ... + 192376542.
It is an arithmetic number, because the mean of its divisors is an integer number (180902109780).
Almost surely, 210110122120982 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10110122120982, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11577735025920).
10110122120982 is an abundant number, since it is smaller than the sum of its proper divisors (13045347930858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110122120982 is a wasteful number, since it uses less digits than its factorization.
10110122120982 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53918.
The product of its (nonzero) digits is 1152, while the sum is 30.
The spelling of 10110122120982 in words is "ten trillion, one hundred ten billion, one hundred twenty-two million, one hundred twenty thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •