Base | Representation |
---|---|
bin | 110011010010001010… |
… | …0110100000110010101 |
3 | 101112021020002122122110 |
4 | 1212210110310012111 |
5 | 3301022030231401 |
6 | 122332111421233 |
7 | 10646102631216 |
oct | 1464424640625 |
9 | 345236078573 |
10 | 110131102101 |
11 | 42785155059 |
12 | 19416824819 |
13 | a501710207 |
14 | 548a78d40d |
15 | 2ce88929d6 |
hex | 19a4534195 |
110131102101 has 16 divisors (see below), whose sum is σ = 157367124864. Its totient is φ = 68330458944.
The previous prime is 110131102069. The next prime is 110131102141. The reversal of 110131102101 is 101201131011.
It is not a de Polignac number, because 110131102101 - 25 = 110131102069 is a prime.
It is a super-2 number, since 2×1101311021012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110131102141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21566406 + ... + 21571511.
It is an arithmetic number, because the mean of its divisors is an integer number (9835445304).
Almost surely, 2110131102101 is an apocalyptic number.
It is an amenable number.
110131102101 is a deficient number, since it is larger than the sum of its proper divisors (47236022763).
110131102101 is a wasteful number, since it uses less digits than its factorization.
110131102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43137980.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 110131102101 its reverse (101201131011), we get a palindrome (211332233112).
The spelling of 110131102101 in words is "one hundred ten billion, one hundred thirty-one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •