Base | Representation |
---|---|
bin | 1100100001110… |
… | …10001111000000 |
3 | 21022202102210012 |
4 | 12100322033000 |
5 | 203401034003 |
6 | 14232324052 |
7 | 2414205464 |
oct | 620721700 |
9 | 238672705 |
10 | 105096128 |
11 | 54362305 |
12 | 2b243628 |
13 | 18a09277 |
14 | dd5a4a4 |
15 | 935e8d8 |
hex | 643a3c0 |
105096128 has 28 divisors (see below), whose sum is σ = 213405720. Its totient is φ = 51324672.
The previous prime is 105096127. The next prime is 105096137. The reversal of 105096128 is 821690501.
It is a super-2 number, since 2×1050961282 = 22090392241184768, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 105096094 and 105096103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105096127) 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 3 ways as a sum of consecutive naturals, for example, 16343 + ... + 21846.
Almost surely, 2105096128 is an apocalyptic number.
It is an amenable number.
105096128 is an abundant number, since it is smaller than the sum of its proper divisors (108309592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105096128 is an equidigital number, since it uses as much as digits as its factorization.
105096128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38244 (or 38234 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 32.
The square root of 105096128 is about 10251.6402590025. The cubic root of 105096128 is about 471.9133231627.
The spelling of 105096128 in words is "one hundred five million, ninety-six thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •