Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0111011100010101101 |
3 | 101112012202200201221200 |
4 | 1212203010323202231 |
5 | 3301001200123234 |
6 | 122330042520113 |
7 | 10645426632516 |
oct | 1464304734255 |
9 | 345182621850 |
10 | 110110161069 |
11 | 42774351817 |
12 | 1940b806039 |
13 | a4ca28a67c |
14 | 5487a9ba0d |
15 | 2ce6b07d99 |
hex | 19a313b8ad |
110110161069 has 48 divisors (see below), whose sum is σ = 163802995200. Its totient is φ = 71251488000.
The previous prime is 110110161059. The next prime is 110110161113. The reversal of 110110161069 is 960161011011.
It is not a de Polignac number, because 110110161069 - 215 = 110110128301 is a prime.
It is a super-2 number, since 2×1101101610692 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110110161059) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 13588119 + ... + 13596219.
It is an arithmetic number, because the mean of its divisors is an integer number (3412562400).
Almost surely, 2110110161069 is an apocalyptic number.
It is an amenable number.
110110161069 is a deficient number, since it is larger than the sum of its proper divisors (53692834131).
110110161069 is a wasteful number, since it uses less digits than its factorization.
110110161069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8506 (or 8503 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 27.
The spelling of 110110161069 in words is "one hundred ten billion, one hundred ten million, one hundred sixty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •