Base | Representation |
---|---|
bin | 110001000000001111… |
… | …0001010010100001000 |
3 | 101001121222110211210211 |
4 | 1202000132022110020 |
5 | 3211010024332240 |
6 | 120202154450504 |
7 | 10413545246335 |
oct | 1420036122410 |
9 | 331558424724 |
10 | 105234605320 |
11 | 406a22115a9 |
12 | 1848aa33a34 |
13 | 9c01150840 |
14 | 514435198c |
15 | 2b0da83bea |
hex | 188078a508 |
105234605320 has 128 divisors (see below), whose sum is σ = 257023549440. Its totient is φ = 38547394560.
The previous prime is 105234605299. The next prime is 105234605353. The reversal of 105234605320 is 23506432501.
It is a happy number.
It is a super-2 number, since 2×1052346053202 (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, 43004337 + ... + 43006783.
It is an arithmetic number, because the mean of its divisors is an integer number (2007996480).
Almost surely, 2105234605320 is an apocalyptic number.
105234605320 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 105234605320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128511774720).
105234605320 is an abundant number, since it is smaller than the sum of its proper divisors (151788944120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105234605320 is a wasteful number, since it uses less digits than its factorization.
105234605320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3095 (or 3091 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
The spelling of 105234605320 in words is "one hundred five billion, two hundred thirty-four million, six hundred five thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •