Base | Representation |
---|---|
bin | 11111000000110110000… |
… | …001101110101111111111 |
3 | 21112202000200222201210022 |
4 | 133000312001232233333 |
5 | 234404204302431421 |
6 | 4311021531002355 |
7 | 306655242551324 |
oct | 37006601565777 |
9 | 7482020881708 |
10 | 2131210202111 |
11 | 751928664751 |
12 | 2a5061b993bb |
13 | 125c84092c13 |
14 | 75218982b4b |
15 | 3a6871e47ab |
hex | 1f03606ebff |
2131210202111 has 4 divisors (see below), whose sum is σ = 2134025539992. Its totient is φ = 2128394864232.
The previous prime is 2131210201997. The next prime is 2131210202113. The reversal of 2131210202111 is 1112020121312.
It is a happy number.
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 2131210202111 - 218 = 2131209939967 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 2131210202111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131210202113) 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, 1407667805 + ... + 1407669318.
It is an arithmetic number, because the mean of its divisors is an integer number (533506384998).
Almost surely, 22131210202111 is an apocalyptic number.
2131210202111 is a deficient number, since it is larger than the sum of its proper divisors (2815337881).
2131210202111 is an equidigital number, since it uses as much as digits as its factorization.
2131210202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2815337880.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 2131210202111 its reverse (1112020121312), we get a palindrome (3243230323423).
The spelling of 2131210202111 in words is "two trillion, one hundred thirty-one billion, two hundred ten million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •