Base | Representation |
---|---|
bin | 11110101101000111001… |
… | …000011000001111101011 |
3 | 21110201100002020212011201 |
4 | 132231013020120033223 |
5 | 234032311203234011 |
6 | 4253155245105031 |
7 | 305305214542504 |
oct | 36550710301753 |
9 | 7421302225151 |
10 | 2110022321131 |
11 | 74394565710a |
12 | 2a0b2a258177 |
13 | 123c8857803a |
14 | 741a8a03bab |
15 | 39d47033cc1 |
hex | 1eb472183eb |
2110022321131 has 4 divisors (see below), whose sum is σ = 2110038967872. Its totient is φ = 2110005674392.
The previous prime is 2110022321129. The next prime is 2110022321149. The reversal of 2110022321131 is 1311232200112.
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 2110022321131 - 21 = 2110022321129 is a prime.
It is a super-2 number, since 2×21100223211312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2110022321099 and 2110022321108.
It is not an unprimeable number, because it can be changed into a prime (2110022321101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8131771 + ... + 8387236.
It is an arithmetic number, because the mean of its divisors is an integer number (527509741968).
Almost surely, 22110022321131 is an apocalyptic number.
2110022321131 is a deficient number, since it is larger than the sum of its proper divisors (16646741).
2110022321131 is a wasteful number, since it uses less digits than its factorization.
2110022321131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16646740.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2110022321131 its reverse (1311232200112), we get a palindrome (3421254521243).
The spelling of 2110022321131 in words is "two trillion, one hundred ten billion, twenty-two million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •