Base | Representation |
---|---|
bin | 11001000011101000110010… |
… | …000001011100101010001110 |
3 | 112110012010022211201110110212 |
4 | 121003220302001130222032 |
5 | 103421013333142333402 |
6 | 1030213405135402422 |
7 | 32132524145402330 |
oct | 3103506201345216 |
9 | 473163284643425 |
10 | 110201110121102 |
11 | 321280347a9850 |
12 | 10439868983412 |
13 | 4964bc65a6010 |
14 | 1d2da95637450 |
15 | cb18b536b952 |
hex | 643a3205ca8e |
110201110121102 has 64 divisors (see below), whose sum is σ = 229596718579200. Its totient is φ = 38266119722880.
The previous prime is 110201110121101. The next prime is 110201110121173. The reversal of 110201110121102 is 201121011102011.
It is a super-2 number, since 2×1102011101211022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201110121101) 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, 949002452 + ... + 949118567.
It is an arithmetic number, because the mean of its divisors is an integer number (3587448727800).
Almost surely, 2110201110121102 is an apocalyptic number.
110201110121102 is an abundant number, since it is smaller than the sum of its proper divisors (119395608458098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201110121102 is a wasteful number, since it uses less digits than its factorization.
110201110121102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1898121081.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110201110121102 its reverse (201121011102011), we get a palindrome (311322121223113).
The spelling of 110201110121102 in words is "one hundred ten trillion, two hundred one billion, one hundred ten million, one hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •