Base | Representation |
---|---|
bin | 1011110000111111110… |
… | …1110101101110101011 |
3 | 201022201212202120101001 |
4 | 2330033331311232223 |
5 | 11302431110111021 |
6 | 232505143535431 |
7 | 20414000654650 |
oct | 2741775655653 |
9 | 638655676331 |
10 | 202131332011 |
11 | 787a595a514 |
12 | 3321145a577 |
13 | 160a3a5a38b |
14 | 9ad71a5c27 |
15 | 53d062a091 |
hex | 2f0ff75bab |
202131332011 has 4 divisors (see below), whose sum is σ = 231007236592. Its totient is φ = 173255427432.
The previous prime is 202131332003. The next prime is 202131332023. The reversal of 202131332011 is 110233131202.
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 202131332011 - 23 = 202131332003 is a prime.
It is a super-2 number, since 2×2021313320112 (a number of 23 digits) contains 22 as substring.
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 202131332011.
It is not an unprimeable number, because it can be changed into a prime (202131332111) 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, 14437952280 + ... + 14437952293.
It is an arithmetic number, because the mean of its divisors is an integer number (57751809148).
Almost surely, 2202131332011 is an apocalyptic number.
202131332011 is a deficient number, since it is larger than the sum of its proper divisors (28875904581).
202131332011 is an equidigital number, since it uses as much as digits as its factorization.
202131332011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28875904580.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 202131332011 its reverse (110233131202), we get a palindrome (312364463213).
The spelling of 202131332011 in words is "two hundred two billion, one hundred thirty-one million, three hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •