Base | Representation |
---|---|
bin | 11110101110001000011… |
… | …111100101110001000101 |
3 | 21110211011111201002200222 |
4 | 132232020133211301011 |
5 | 234042032421043434 |
6 | 4253500141114125 |
7 | 305344331532113 |
oct | 36561037456105 |
9 | 7424144632628 |
10 | 2111118924869 |
11 | 744358661799 |
12 | 2a1195558945 |
13 | 124101809ba6 |
14 | 742704daab3 |
15 | 39dad44872e |
hex | 1eb887e5c45 |
2111118924869 has 2 divisors, whose sum is σ = 2111118924870. Its totient is φ = 2111118924868.
The previous prime is 2111118924857. The next prime is 2111118924877. The reversal of 2111118924869 is 9684298111112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1828160889025 + 282958035844 = 1352095^2 + 531938^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111118924869 - 24 = 2111118924853 is a prime.
It is a super-2 number, since 2×21111189248692 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2111118924869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111118924269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055559462434 + 1055559462435.
It is an arithmetic number, because the mean of its divisors is an integer number (1055559462435).
Almost surely, 22111118924869 is an apocalyptic number.
It is an amenable number.
2111118924869 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111118924869 is an equidigital number, since it uses as much as digits as its factorization.
2111118924869 is an evil number, because the sum of its binary digits is even.
The product of its digits is 497664, while the sum is 53.
The spelling of 2111118924869 in words is "two trillion, one hundred eleven billion, one hundred eighteen million, nine hundred twenty-four thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •