Base | Representation |
---|---|
bin | 110011010001011001… |
… | …1001100010010001011 |
3 | 101112012102221111022210 |
4 | 1212202303030102023 |
5 | 3300444002323201 |
6 | 122325355120203 |
7 | 10645342254564 |
oct | 1464263142213 |
9 | 345172844283 |
10 | 110105511051 |
11 | 42771766128 |
12 | 1940a143063 |
13 | a4c931cc93 |
14 | 548720b16b |
15 | 2ce64da1d6 |
hex | 19a2ccc48b |
110105511051 has 16 divisors (see below), whose sum is σ = 150817055744. Its totient is φ = 71399924064.
The previous prime is 110105511023. The next prime is 110105511091. The reversal of 110105511051 is 150115501011.
It is not a de Polignac number, because 110105511051 - 227 = 109971293323 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110105511091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 268230 + ... + 540516.
It is an arithmetic number, because the mean of its divisors is an integer number (9426065984).
Almost surely, 2110105511051 is an apocalyptic number.
110105511051 is a deficient number, since it is larger than the sum of its proper divisors (40711544693).
110105511051 is a wasteful number, since it uses less digits than its factorization.
110105511051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275970.
The product of its (nonzero) digits is 125, while the sum is 21.
The spelling of 110105511051 in words is "one hundred ten billion, one hundred five million, five hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •