Base | Representation |
---|---|
bin | 110001100111111011… |
… | …1010111000011011000 |
3 | 101012001210212202022110 |
4 | 1203033313113003120 |
5 | 3221222023024120 |
6 | 120542300152320 |
7 | 10461551151312 |
oct | 1431767270330 |
9 | 335053782273 |
10 | 106566611160 |
11 | 4121608a279 |
12 | 187a0b386a0 |
13 | a0840b3789 |
14 | 522d2047b2 |
15 | 2b8a9972e0 |
hex | 18cfdd70d8 |
106566611160 has 128 divisors (see below), whose sum is σ = 342616366080. Its totient is φ = 26447528448.
The previous prime is 106566611149. The next prime is 106566611161. The reversal of 106566611160 is 61116665601.
106566611160 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1065666111602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106566611161) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 419652 + ... + 623891.
It is an arithmetic number, because the mean of its divisors is an integer number (2676690360).
Almost surely, 2106566611160 is an apocalyptic number.
106566611160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106566611160 is an abundant number, since it is smaller than the sum of its proper divisors (236049754920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106566611160 is a wasteful number, since it uses less digits than its factorization.
106566611160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1043617 (or 1043613 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 39.
The spelling of 106566611160 in words is "one hundred six billion, five hundred sixty-six million, six hundred eleven thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •