Base | Representation |
---|---|
bin | 110001001011100111… |
… | …1010111000000011000 |
3 | 101002121121021020112010 |
4 | 1202113033113000120 |
5 | 3212300322213422 |
6 | 120304122145520 |
7 | 10426164203601 |
oct | 1422717270030 |
9 | 332547236463 |
10 | 105616601112 |
11 | 408788aa700 |
12 | 185769522a0 |
13 | 9c6232a259 |
14 | 517cd8ada8 |
15 | 2b3238cb0c |
hex | 18973d7018 |
105616601112 has 48 divisors (see below), whose sum is σ = 290227444920. Its totient is φ = 32005029760.
The previous prime is 105616601107. The next prime is 105616601113. The reversal of 105616601112 is 211106616501.
It is a super-2 number, since 2×1056166011122 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105616601112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105616601113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18181773 + ... + 18187580.
Almost surely, 2105616601112 is an apocalyptic number.
105616601112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105616601112 is an abundant number, since it is smaller than the sum of its proper divisors (184610843808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105616601112 is a wasteful number, since it uses less digits than its factorization.
105616601112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36369384 (or 36369369 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 30.
The spelling of 105616601112 in words is "one hundred five billion, six hundred sixteen million, six hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •