Base | Representation |
---|---|
bin | 110000111100101101… |
… | …1111000011001111000 |
3 | 101001022202100212220010 |
4 | 1201321123320121320 |
5 | 3210234320122120 |
6 | 120142340501520 |
7 | 10410613035633 |
oct | 1417133703170 |
9 | 331282325803 |
10 | 105116567160 |
11 | 4064161a800 |
12 | 184573aa8a0 |
13 | 9bb2862887 |
14 | 51327c6c1a |
15 | 2b035197e0 |
hex | 18796f8678 |
105116567160 has 384 divisors, whose sum is σ = 368664125760. Its totient is φ = 23876075520.
The previous prime is 105116567123. The next prime is 105116567183. The reversal of 105116567160 is 61765611501.
It is a super-2 number, since 2×1051165671602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 63437052 + ... + 63438708.
Almost surely, 2105116567160 is an apocalyptic number.
105116567160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105116567160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184332062880).
105116567160 is an abundant number, since it is smaller than the sum of its proper divisors (263547558600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105116567160 is a wasteful number, since it uses less digits than its factorization.
105116567160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1967 (or 1952 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 39.
It can be divided in two parts, 105116 and 567160, that added together give a palindrome (672276).
The spelling of 105116567160 in words is "one hundred five billion, one hundred sixteen million, five hundred sixty-seven thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •