Base | Representation |
---|---|
bin | 111110111100100… |
… | …0100001101000111 |
3 | 12110012022101012022 |
4 | 1331321010031013 |
5 | 13311200031211 |
6 | 545325513355 |
7 | 103224436163 |
oct | 17571041507 |
9 | 5405271168 |
10 | 2112111431 |
11 | 994260641 |
12 | 4ab41285b |
13 | 27876b7a1 |
14 | 16071dca3 |
15 | c565abdb |
hex | 7de44347 |
2112111431 has 4 divisors (see below), whose sum is σ = 2112563352. Its totient is φ = 2111659512.
The previous prime is 2112111403. The next prime is 2112111461. The reversal of 2112111431 is 1341112112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2112111431 - 222 = 2107917127 is a prime.
It is a super-2 number, since 2×21121114312 = 8922029393921735522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112111401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 218876 + ... + 228321.
It is an arithmetic number, because the mean of its divisors is an integer number (528140838).
Almost surely, 22112111431 is an apocalyptic number.
2112111431 is a deficient number, since it is larger than the sum of its proper divisors (451921).
2112111431 is an equidigital number, since it uses as much as digits as its factorization.
2112111431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451920.
The product of its digits is 48, while the sum is 17.
The square root of 2112111431 is about 45957.7135092685. The cubic root of 2112111431 is about 1283.0362959170.
Adding to 2112111431 its reverse (1341112112), we get a palindrome (3453223543).
The spelling of 2112111431 in words is "two billion, one hundred twelve million, one hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •