Base | Representation |
---|---|
bin | 110001100011100100… |
… | …0010100100100111000 |
3 | 101011200121010022101001 |
4 | 1203013020110210320 |
5 | 3220422014000040 |
6 | 120515543134344 |
7 | 10455121414642 |
oct | 1430710244470 |
9 | 334617108331 |
10 | 106420062520 |
11 | 411503950a2 |
12 | 1875ba443b4 |
13 | a05c9227c5 |
14 | 5217977892 |
15 | 2b7cb9a59a |
hex | 18c7214938 |
106420062520 has 64 divisors (see below), whose sum is σ = 253375050240. Its totient is φ = 40143734400.
The previous prime is 106420062517. The next prime is 106420062527. The reversal of 106420062520 is 25260024601.
It is a super-2 number, since 2×1064200625202 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106420062527) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 749286 + ... + 879925.
It is an arithmetic number, because the mean of its divisors is an integer number (3958985160).
Almost surely, 2106420062520 is an apocalyptic number.
106420062520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106420062520 is an abundant number, since it is smaller than the sum of its proper divisors (146954987720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106420062520 is a wasteful number, since it uses less digits than its factorization.
106420062520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1629316 (or 1629312 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
The spelling of 106420062520 in words is "one hundred six billion, four hundred twenty million, sixty-two thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •