Base | Representation |
---|---|
bin | 110001110101001010… |
… | …0000100001111101100 |
3 | 101020012201211201012222 |
4 | 1203222110010033230 |
5 | 3223124122001131 |
6 | 121054311014512 |
7 | 10505546625650 |
oct | 1435224041754 |
9 | 336181751188 |
10 | 107010343916 |
11 | 41423605263 |
12 | 188a566a438 |
13 | a124cc7938 |
14 | 5272110a60 |
15 | 2bb48e887b |
hex | 18ea5043ec |
107010343916 has 96 divisors (see below), whose sum is σ = 232854773760. Its totient is φ = 42010242624.
The previous prime is 107010343901. The next prime is 107010343987. The reversal of 107010343916 is 619343010701.
It is a happy number.
It is a super-2 number, since 2×1070103439162 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2049551 + ... + 2101113.
It is an arithmetic number, because the mean of its divisors is an integer number (2425570560).
Almost surely, 2107010343916 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 107010343916, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116427386880).
107010343916 is an abundant number, since it is smaller than the sum of its proper divisors (125844429844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107010343916 is a wasteful number, since it uses less digits than its factorization.
107010343916 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51723 (or 51721 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 35.
The spelling of 107010343916 in words is "one hundred seven billion, ten million, three hundred forty-three thousand, nine hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •