Base | Representation |
---|---|
bin | 11001000011101000110010… |
… | …001000101010000101011110 |
3 | 112110012010022222021111001212 |
4 | 121003220302020222011132 |
5 | 103421013334133323402 |
6 | 1030213405244104422 |
7 | 32132524200433460 |
oct | 3103506210520536 |
9 | 473163288244055 |
10 | 110201112011102 |
11 | 3212803587a832 |
12 | 10439869535112 |
13 | 4964bc6ab8368 |
14 | 1d2da959aa130 |
15 | cb18b55e1952 |
hex | 643a3222a15e |
110201112011102 has 64 divisors (see below), whose sum is σ = 192072215347200. Its totient is φ = 46447841664000.
The previous prime is 110201112011101. The next prime is 110201112011147. The reversal of 110201112011102 is 201110211102011.
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 (110201112011101) 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, 129653102 + ... + 130500302.
It is an arithmetic number, because the mean of its divisors is an integer number (3001128364800).
Almost surely, 2110201112011102 is an apocalyptic number.
110201112011102 is a deficient number, since it is larger than the sum of its proper divisors (81871103336098).
110201112011102 is a wasteful number, since it uses less digits than its factorization.
110201112011102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 847977.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110201112011102 its reverse (201110211102011), we get a palindrome (311311323113113).
Subtracting 110201112011102 from its reverse (201110211102011), we obtain a palindrome (90909099090909).
The spelling of 110201112011102 in words is "one hundred ten trillion, two hundred one billion, one hundred twelve million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •