Base | Representation |
---|---|
bin | 11111000001100101001… |
… | …110001101010110000111 |
3 | 21112211001212220100110122 |
4 | 133001211032031112013 |
5 | 234412320003033221 |
6 | 4311232254012155 |
7 | 310013666003606 |
oct | 37014516152607 |
9 | 7484055810418 |
10 | 2132002002311 |
11 | 7521a4604985 |
12 | 2a52431a705b |
13 | 12607c13474c |
14 | 75291bb5a3d |
15 | 3a6d199beab |
hex | 1f06538d587 |
2132002002311 has 2 divisors, whose sum is σ = 2132002002312. Its totient is φ = 2132002002310.
The previous prime is 2132002002289. The next prime is 2132002002323. The reversal of 2132002002311 is 1132002002312.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2132002002311 is a prime.
It is a super-2 number, since 2×21320020023112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2132002002311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2132002002511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1066001001155 + 1066001001156.
It is an arithmetic number, because the mean of its divisors is an integer number (1066001001156).
Almost surely, 22132002002311 is an apocalyptic number.
2132002002311 is a deficient number, since it is larger than the sum of its proper divisors (1).
2132002002311 is an equidigital number, since it uses as much as digits as its factorization.
2132002002311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2132002002311 its reverse (1132002002312), we get a palindrome (3264004004623).
Subtracting from 2132002002311 its reverse (1132002002312), we obtain a palindrome (999999999999).
The spelling of 2132002002311 in words is "two trillion, one hundred thirty-two billion, two million, two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •