Base | Representation |
---|---|
bin | 11110111111101111110… |
… | …000001111001001100111 |
3 | 21112121222112111210011222 |
4 | 132333233300033021213 |
5 | 234344300442223421 |
6 | 4310304533050555 |
7 | 306614105363636 |
oct | 36775760171147 |
9 | 7477875453158 |
10 | 2130031211111 |
11 | 7513830a8321 |
12 | 2a4993186a5b |
13 | 125b26a461cb |
14 | 7514616151d |
15 | 3a618958cab |
hex | 1efefc0f267 |
2130031211111 has 16 divisors (see below), whose sum is σ = 2237801541120. Its totient is φ = 2023529560800.
The previous prime is 2130031211089. The next prime is 2130031211117. The reversal of 2130031211111 is 1111121300312.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2130031211111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2130031211111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2130031211117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18380396 + ... + 18495918.
It is an arithmetic number, because the mean of its divisors is an integer number (139862596320).
Almost surely, 22130031211111 is an apocalyptic number.
2130031211111 is a deficient number, since it is larger than the sum of its proper divisors (107770330009).
2130031211111 is a wasteful number, since it uses less digits than its factorization.
2130031211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121006.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 2130031211111 its reverse (1111121300312), we get a palindrome (3241152511423).
It can be divided in two parts, 21300312 and 11111, that multiplied together give a palindrome (236667766632).
The spelling of 2130031211111 in words is "two trillion, one hundred thirty billion, thirty-one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •