Base | Representation |
---|---|
bin | 1100101100111… |
… | …10100010111100 |
3 | 21102111120202222 |
4 | 12112132202330 |
5 | 204234234310 |
6 | 14323504512 |
7 | 2432464445 |
oct | 626364274 |
9 | 242446688 |
10 | 106555580 |
11 | 5516986a |
12 | 2b828138 |
13 | 190ca651 |
14 | 1021a2cc |
15 | 954c055 |
hex | 659e8bc |
106555580 has 24 divisors (see below), whose sum is σ = 228529728. Its totient is φ = 41715008.
The previous prime is 106555571. The next prime is 106555583. The reversal of 106555580 is 85555601.
It is a super-3 number, since 3×1065555803 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 106555580.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106555583) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55739 + ... + 57618.
It is an arithmetic number, because the mean of its divisors is an integer number (9522072).
Almost surely, 2106555580 is an apocalyptic number.
106555580 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106555580 is an abundant number, since it is smaller than the sum of its proper divisors (121974148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106555580 is a wasteful number, since it uses less digits than its factorization.
106555580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113413 (or 113411 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 35.
The square root of 106555580 is about 10322.5762288297. The cubic root of 106555580 is about 474.0877486546.
The spelling of 106555580 in words is "one hundred six million, five hundred fifty-five thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •