Base | Representation |
---|---|
bin | 111110111011011… |
… | …0011110101101001 |
3 | 12110011012100001100 |
4 | 1331312303311221 |
5 | 13311022120410 |
6 | 545305112013 |
7 | 103216424202 |
oct | 17566636551 |
9 | 5404170040 |
10 | 2111520105 |
11 | 993997342 |
12 | 4ab188609 |
13 | 2785c25a6 |
14 | 1606085a9 |
15 | c55908c0 |
hex | 7ddb3d69 |
2111520105 has 48 divisors (see below), whose sum is σ = 3918929040. Its totient is φ = 1047957504.
The previous prime is 2111520097. The next prime is 2111520113. The reversal of 2111520105 is 5010251112.
It is an interprime number because it is at equal distance from previous prime (2111520097) and next prime (2111520113).
It can be written as a sum of positive squares in 8 ways, for example, as 419102784 + 1692417321 = 20472^2 + 41139^2 .
It is not a de Polignac number, because 2111520105 - 23 = 2111520097 is a prime.
It is a super-2 number, since 2×21115201052 = 8917034307638422050, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 52579 + ... + 83591.
It is an arithmetic number, because the mean of its divisors is an integer number (81644355).
Almost surely, 22111520105 is an apocalyptic number.
It is an amenable number.
2111520105 is a deficient number, since it is larger than the sum of its proper divisors (1807408935).
2111520105 is a wasteful number, since it uses less digits than its factorization.
2111520105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31130 (or 31127 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
The square root of 2111520105 is about 45951.2796883830. The cubic root of 2111520105 is about 1282.9165478892.
Adding to 2111520105 its reverse (5010251112), we get a palindrome (7121771217).
The spelling of 2111520105 in words is "two billion, one hundred eleven million, five hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •