Base | Representation |
---|---|
bin | 110001100010100100… |
… | …0100011101110001000 |
3 | 101011121021002201102210 |
4 | 1203011020203232020 |
5 | 3220334430220440 |
6 | 120512345225120 |
7 | 10454233632315 |
oct | 1430510435610 |
9 | 334537081383 |
10 | 106386570120 |
11 | 41133499826 |
12 | 187507921a0 |
13 | a0559c700c |
14 | 5213339d0c |
15 | 2b79c81a80 |
hex | 18c5223b88 |
106386570120 has 128 divisors (see below), whose sum is σ = 321211008000. Its totient is φ = 28187824896.
The previous prime is 106386570119. The next prime is 106386570137. The reversal of 106386570120 is 21075683601.
It is a super-2 number, since 2×1063865701202 (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, 19746067 + ... + 19751453.
It is an arithmetic number, because the mean of its divisors is an integer number (2509461000).
Almost surely, 2106386570120 is an apocalyptic number.
106386570120 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 106386570120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160605504000).
106386570120 is an abundant number, since it is smaller than the sum of its proper divisors (214824437880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106386570120 is a wasteful number, since it uses less digits than its factorization.
106386570120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6427 (or 6423 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 39.
The spelling of 106386570120 in words is "one hundred six billion, three hundred eighty-six million, five hundred seventy thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •