Base | Representation |
---|---|
bin | 1100101101011… |
… | …01111001011100 |
3 | 21102121210000212 |
4 | 12112231321130 |
5 | 204243242320 |
6 | 14325111552 |
7 | 2433145664 |
oct | 626557134 |
9 | 242553025 |
10 | 106618460 |
11 | 55202033 |
12 | 2b8585b8 |
13 | 19120160 |
14 | 102351a4 |
15 | 95609c5 |
hex | 65ade5c |
106618460 has 48 divisors (see below), whose sum is σ = 247660896. Its totient is φ = 38299392.
The previous prime is 106618427. The next prime is 106618489. The reversal of 106618460 is 64816601.
It is a happy number.
It is a super-2 number, since 2×1066184602 = 22734992025543200, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4079 + ... + 15161.
It is an arithmetic number, because the mean of its divisors is an integer number (5159602).
Almost surely, 2106618460 is an apocalyptic number.
106618460 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 106618460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123830448).
106618460 is an abundant number, since it is smaller than the sum of its proper divisors (141042436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106618460 is a wasteful number, since it uses less digits than its factorization.
106618460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11142 (or 11140 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 32.
The square root of 106618460 is about 10325.6215309297. The cubic root of 106618460 is about 474.1809856791.
The spelling of 106618460 in words is "one hundred six million, six hundred eighteen thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •