Base | Representation |
---|---|
bin | 111110111100011… |
… | …0000100110000111 |
3 | 12110012011022000111 |
4 | 1331320300212013 |
5 | 13311134443421 |
6 | 545324053451 |
7 | 103223653051 |
oct | 17570604607 |
9 | 5405138014 |
10 | 2112031111 |
11 | 994206263 |
12 | 4ab394287 |
13 | 278741068 |
14 | 1606dc8d1 |
15 | c5641ee1 |
hex | 7de30987 |
2112031111 has 8 divisors (see below), whose sum is σ = 2199333600. Its totient is φ = 2025693600.
The previous prime is 2112031087. The next prime is 2112031139. The reversal of 2112031111 is 1111302112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2112031111 - 211 = 2112029063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2112031091 and 2112031100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112031211) 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 7 ways as a sum of consecutive naturals, for example, 236776 + ... + 245533.
It is an arithmetic number, because the mean of its divisors is an integer number (274916700).
Almost surely, 22112031111 is an apocalyptic number.
2112031111 is a deficient number, since it is larger than the sum of its proper divisors (87302489).
2112031111 is a wasteful number, since it uses less digits than its factorization.
2112031111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482489.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 2112031111 is about 45956.8396541799. The cubic root of 2112031111 is about 1283.0200318159.
Adding to 2112031111 its reverse (1111302112), we get a palindrome (3223333223).
The spelling of 2112031111 in words is "two billion, one hundred twelve million, thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •