Base | Representation |
---|---|
bin | 110001001000100101… |
… | …1111111110111100100 |
3 | 101002100112012020122201 |
4 | 1202101023333313210 |
5 | 3212043323302422 |
6 | 120250053504244 |
7 | 10423522116520 |
oct | 1422113776744 |
9 | 332315166581 |
10 | 105515056612 |
11 | 40826553829 |
12 | 18548942084 |
13 | 9c47295754 |
14 | 516d6b6d80 |
15 | 2b284d0727 |
hex | 18912ffde4 |
105515056612 has 96 divisors (see below), whose sum is σ = 234076953600. Its totient is φ = 40572499968.
The previous prime is 105515056607. The next prime is 105515056637. The reversal of 105515056612 is 216650515501.
It is a super-2 number, since 2×1055150566122 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1042138 + ... + 1138894.
It is an arithmetic number, because the mean of its divisors is an integer number (2438301600).
Almost surely, 2105515056612 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105515056612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117038476800).
105515056612 is an abundant number, since it is smaller than the sum of its proper divisors (128561896988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105515056612 is a wasteful number, since it uses less digits than its factorization.
105515056612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96893 (or 96891 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 37.
The spelling of 105515056612 in words is "one hundred five billion, five hundred fifteen million, fifty-six thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •