Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1110101101011010100 |
3 | 101112110002210222002201 |
4 | 1212220133311223110 |
5 | 3301142440213022 |
6 | 122343052014244 |
7 | 10650612621532 |
oct | 1465037655324 |
9 | 345402728081 |
10 | 110201101012 |
11 | 428107152a2 |
12 | 19436161384 |
13 | a51307b3a2 |
14 | 5495bb1152 |
15 | 2ceeabd127 |
hex | 19a87f5ad4 |
110201101012 has 48 divisors (see below), whose sum is σ = 208024286400. Its totient is φ = 50909955840.
The previous prime is 110201101007. The next prime is 110201101033. The reversal of 110201101012 is 210101102011.
110201101012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 110201101012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15585814 + ... + 15592882.
It is an arithmetic number, because the mean of its divisors is an integer number (4333839300).
Almost surely, 2110201101012 is an apocalyptic number.
It is an amenable number.
110201101012 is a deficient number, since it is larger than the sum of its proper divisors (97823185388).
110201101012 is a wasteful number, since it uses less digits than its factorization.
110201101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12136 (or 12134 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110201101012 its reverse (210101102011), we get a palindrome (320302203023).
Subtracting 110201101012 from its reverse (210101102011), we obtain a palindrome (99900000999).
The spelling of 110201101012 in words is "one hundred ten billion, two hundred one million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •