Base | Representation |
---|---|
bin | 1001001100011111001000… |
… | …1111100001001111110110 |
3 | 1022210111222210120201222020 |
4 | 2103013302033201033312 |
5 | 2311121012240431402 |
6 | 33300305342014010 |
7 | 2062301152540146 |
oct | 223076217411766 |
9 | 38714883521866 |
10 | 10110122202102 |
11 | 324875145a3aa |
12 | 11734ab577306 |
13 | 5844c3a70760 |
14 | 26d492642926 |
15 | 127ec2b288bc |
hex | 931f23e13f6 |
10110122202102 has 64 divisors (see below), whose sum is σ = 21992139187200. Its totient is φ = 3079893446784.
The previous prime is 10110122202077. The next prime is 10110122202107. The reversal of 10110122202102 is 20120222101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110122202107) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35182399 + ... + 35468597.
It is an arithmetic number, because the mean of its divisors is an integer number (343627174800).
Almost surely, 210110122202102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10110122202102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10996069593600).
10110122202102 is an abundant number, since it is smaller than the sum of its proper divisors (11882016985098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110122202102 is a wasteful number, since it uses less digits than its factorization.
10110122202102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290717.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10110122202102 its reverse (20120222101101), we get a palindrome (30230344303203).
The spelling of 10110122202102 in words is "ten trillion, one hundred ten billion, one hundred twenty-two million, two hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •