Base | Representation |
---|---|
bin | 110011100101110110… |
… | …1111101010110010011 |
3 | 101120222021201000000000 |
4 | 1213023231331112103 |
5 | 3303400223130021 |
6 | 122521441101043 |
7 | 11001346334652 |
oct | 1471355752623 |
9 | 346867630000 |
10 | 110792005011 |
11 | 42a94220206 |
12 | 19580027783 |
13 | a5a8610a1c |
14 | 551046b199 |
15 | 2d368e0b26 |
hex | 19cbb7d593 |
110792005011 has 40 divisors (see below), whose sum is σ = 166376597200. Its totient is φ = 73776292992.
The previous prime is 110792005007. The next prime is 110792005013. The reversal of 110792005011 is 110500297011.
It is not a de Polignac number, because 110792005011 - 22 = 110792005007 is a prime.
It is a super-2 number, since 2×1107920050112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110792005013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 20329815 + ... + 20335263.
It is an arithmetic number, because the mean of its divisors is an integer number (4159414930).
Almost surely, 2110792005011 is an apocalyptic number.
110792005011 is a deficient number, since it is larger than the sum of its proper divisors (55584592189).
110792005011 is an frugal number, since it uses more digits than its factorization.
110792005011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6509 (or 6485 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 27.
The spelling of 110792005011 in words is "one hundred ten billion, seven hundred ninety-two million, five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •