Base | Representation |
---|---|
bin | 1100100010101… |
… | …10010011110000 |
3 | 21022222021112011 |
4 | 12101112103300 |
5 | 203413223440 |
6 | 14235012304 |
7 | 2415164650 |
oct | 621262360 |
9 | 238867464 |
10 | 105211120 |
11 | 54430743 |
12 | 2b29a094 |
13 | 18a49701 |
14 | dd8a360 |
15 | 93839ea |
hex | 64564f0 |
105211120 has 40 divisors (see below), whose sum is σ = 279562464. Its totient is φ = 36072192.
The previous prime is 105211111. The next prime is 105211123. The reversal of 105211120 is 21112501.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×1052111202 = 22138759543308800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105211120.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105211123) 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, 93379 + ... + 94498.
Almost surely, 2105211120 is an apocalyptic number.
105211120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105211120 is an abundant number, since it is smaller than the sum of its proper divisors (174351344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105211120 is a wasteful number, since it uses less digits than its factorization.
105211120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187897 (or 187891 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 105211120 is about 10257.2471940575. The cubic root of 105211120 is about 472.0853766846.
Adding to 105211120 its reverse (21112501), we get a palindrome (126323621).
The spelling of 105211120 in words is "one hundred five million, two hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •