Base | Representation |
---|---|
bin | 1100101000100… |
… | …10110000000100 |
3 | 21101102111022120 |
4 | 12110102300010 |
5 | 204112423410 |
6 | 14303325540 |
7 | 2424561165 |
oct | 624226004 |
9 | 241374276 |
10 | 105982980 |
11 | 54908644 |
12 | 2b5b08b0 |
13 | 18c59b2c |
14 | 1010b76c |
15 | 9487570 |
hex | 6512c04 |
105982980 has 72 divisors (see below), whose sum is σ = 301469952. Its totient is φ = 27819264.
The previous prime is 105982963. The next prime is 105982997. The reversal of 105982980 is 89289501.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (105982963) and next prime (105982997).
It is a super-2 number, since 2×1059829802 = 22464784099360800, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 475149 + ... + 475371.
Almost surely, 2105982980 is an apocalyptic number.
105982980 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 105982980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150734976).
105982980 is an abundant number, since it is smaller than the sum of its proper divisors (195486972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105982980 is a wasteful number, since it uses less digits than its factorization.
105982980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413 (or 322 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 42.
The square root of 105982980 is about 10294.8035435359. The cubic root of 105982980 is about 473.2370178071.
The spelling of 105982980 in words is "one hundred five million, nine hundred eighty-two thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.042 sec. • engine limits •