Base | Representation |
---|---|
bin | 1100100101110… |
… | …10100100001000 |
3 | 21100202010211100 |
4 | 12102322210020 |
5 | 204014344033 |
6 | 14251501400 |
7 | 2421525120 |
oct | 622724410 |
9 | 240663740 |
10 | 105621768 |
11 | 5469121a |
12 | 2b457860 |
13 | 18b615b5 |
14 | 10055c80 |
15 | 9415513 |
hex | 64ba908 |
105621768 has 48 divisors (see below), whose sum is σ = 326926080. Its totient is φ = 30177504.
The previous prime is 105621767. The next prime is 105621787. The reversal of 105621768 is 867126501.
It is a super-2 number, since 2×1056217682 = 22311915750891648, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (105621767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 104280 + ... + 105287.
It is an arithmetic number, because the mean of its divisors is an integer number (6810960).
Almost surely, 2105621768 is an apocalyptic number.
105621768 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
105621768 is an abundant number, since it is smaller than the sum of its proper divisors (221304312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105621768 is a wasteful number, since it uses less digits than its factorization.
105621768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209586 (or 209579 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 105621768 is about 10277.2451561690. The cubic root of 105621768 is about 472.6987758597.
The spelling of 105621768 in words is "one hundred five million, six hundred twenty-one thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •