Base | Representation |
---|---|
bin | 1100100111001… |
… | …11101100100100 |
3 | 21101002112102000 |
4 | 12103213230210 |
5 | 204041303003 |
6 | 14255445300 |
7 | 2423225064 |
oct | 623475444 |
9 | 241075360 |
10 | 105806628 |
11 | 547a80a4 |
12 | 2b526830 |
13 | 18bc7795 |
14 | 100a33a4 |
15 | 94501a3 |
hex | 64e7b24 |
105806628 has 24 divisors (see below), whose sum is σ = 274313760. Its totient is φ = 35268840.
The previous prime is 105806599. The next prime is 105806633. The reversal of 105806628 is 826608501.
It is a happy number.
105806628 is a `hidden beast` number, since 10 + 580 + 6 + 62 + 8 = 666.
It is a super-2 number, since 2×1058066282 = 22390085057460768, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 105806592 and 105806601.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 489738 + ... + 489953.
It is an arithmetic number, because the mean of its divisors is an integer number (11429740).
Almost surely, 2105806628 is an apocalyptic number.
105806628 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
105806628 is an abundant number, since it is smaller than the sum of its proper divisors (168507132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105806628 is a wasteful number, since it uses less digits than its factorization.
105806628 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 979704 (or 979696 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The square root of 105806628 is about 10286.2348796827. The cubic root of 105806628 is about 472.9743887609.
The spelling of 105806628 in words is "one hundred five million, eight hundred six thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •