Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0111011100010101110 |
3 | 101112012202200201221201 |
4 | 1212203010323202232 |
5 | 3301001200123240 |
6 | 122330042520114 |
7 | 10645426632520 |
oct | 1464304734256 |
9 | 345182621851 |
10 | 110110161070 |
11 | 42774351818 |
12 | 1940b80603a |
13 | a4ca28a680 |
14 | 5487a9ba10 |
15 | 2ce6b07d9a |
hex | 19a313b8ae |
110110161070 has 64 divisors (see below), whose sum is σ = 246304880640. Its totient is φ = 34509691008.
The previous prime is 110110161059. The next prime is 110110161113. The reversal of 110110161070 is 70161011011.
It is a happy number.
It is a super-2 number, since 2×1101101610702 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 493650 + ... + 681109.
It is an arithmetic number, because the mean of its divisors is an integer number (3848513760).
Almost surely, 2110110161070 is an apocalyptic number.
110110161070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110110161070 is an abundant number, since it is smaller than the sum of its proper divisors (136194719570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110161070 is a wasteful number, since it uses less digits than its factorization.
110110161070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1174889.
The product of its (nonzero) digits is 42, while the sum is 19.
Adding to 110110161070 its reverse (70161011011), we get a palindrome (180271172081).
The spelling of 110110161070 in words is "one hundred ten billion, one hundred ten million, one hundred sixty-one thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •