Base | Representation |
---|---|
bin | 110011100001111110… |
… | …0100001011011000101 |
3 | 101120122012022222220020 |
4 | 1213003330201123011 |
5 | 3303113332330221 |
6 | 122500502125353 |
7 | 10665204060120 |
oct | 1470374413305 |
9 | 346565288806 |
10 | 110661605061 |
11 | 42a27655857 |
12 | 19544420859 |
13 | a5875b51a7 |
14 | 54db0053b7 |
15 | 2d2a233ac6 |
hex | 19c3f216c5 |
110661605061 has 16 divisors (see below), whose sum is σ = 169601937024. Its totient is φ = 62869679424.
The previous prime is 110661605027. The next prime is 110661605081. The reversal of 110661605061 is 160506166011.
It is not a de Polignac number, because 110661605061 - 210 = 110661604037 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110661605081) 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 15 ways as a sum of consecutive naturals, for example, 15226426 + ... + 15233691.
It is an arithmetic number, because the mean of its divisors is an integer number (10600121064).
Almost surely, 2110661605061 is an apocalyptic number.
It is an amenable number.
110661605061 is a deficient number, since it is larger than the sum of its proper divisors (58940331963).
110661605061 is a wasteful number, since it uses less digits than its factorization.
110661605061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30460300.
The product of its (nonzero) digits is 6480, while the sum is 33.
The spelling of 110661605061 in words is "one hundred ten billion, six hundred sixty-one million, six hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •