Base | Representation |
---|---|
bin | 110001000110111111… |
… | …0011010100011001100 |
3 | 101002012202210020012210 |
4 | 1202031332122203030 |
5 | 3211441024223421 |
6 | 120240450430420 |
7 | 10422266051061 |
oct | 1421576324314 |
9 | 332182706183 |
10 | 105461164236 |
11 | 407a909467a |
12 | 18532892410 |
13 | 9c3907677c |
14 | 5166488c68 |
15 | 2b238d7576 |
hex | 188df9a8cc |
105461164236 has 24 divisors (see below), whose sum is σ = 248013660160. Its totient is φ = 34876919952.
The previous prime is 105461164231. The next prime is 105461164247. The reversal of 105461164236 is 632461164501.
It is a super-2 number, since 2×1054611642362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105461164194 and 105461164203.
It is not an unprimeable number, because it can be changed into a prime (105461164231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34598596 + ... + 34601643.
Almost surely, 2105461164236 is an apocalyptic number.
It is an amenable number.
105461164236 is an abundant number, since it is smaller than the sum of its proper divisors (142552495924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105461164236 is a wasteful number, since it uses less digits than its factorization.
105461164236 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69200373 (or 69200371 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 39.
The spelling of 105461164236 in words is "one hundred five billion, four hundred sixty-one million, one hundred sixty-four thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •