Base | Representation |
---|---|
bin | 110001001100101000… |
… | …0101110110011011001 |
3 | 101002200222002020212000 |
4 | 1202121100232303121 |
5 | 3212333012441121 |
6 | 120311333111213 |
7 | 10430055363432 |
oct | 1423120566331 |
9 | 332628066760 |
10 | 105650515161 |
11 | 40895a63844 |
12 | 18586188509 |
13 | 9c69372939 |
14 | 5183698489 |
15 | 2b3533b526 |
hex | 189942ecd9 |
105650515161 has 32 divisors (see below), whose sum is σ = 157201689600. Its totient is φ = 70127003520.
The previous prime is 105650515141. The next prime is 105650515231. The reversal of 105650515161 is 161515056501.
It is a happy number.
It is not a de Polignac number, because 105650515161 - 26 = 105650515097 is a prime.
It is a super-2 number, since 2×1056505151612 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (105650515141) 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, 10912855 + ... + 10922531.
It is an arithmetic number, because the mean of its divisors is an integer number (4912552800).
Almost surely, 2105650515161 is an apocalyptic number.
It is an amenable number.
105650515161 is a deficient number, since it is larger than the sum of its proper divisors (51551174439).
105650515161 is a wasteful number, since it uses less digits than its factorization.
105650515161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11406 (or 11400 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
The spelling of 105650515161 in words is "one hundred five billion, six hundred fifty million, five hundred fifteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •