Base | Representation |
---|---|
bin | 1011101101100010010… |
… | …1001011100110101011 |
3 | 201020100010021202200021 |
4 | 2323120211023212223 |
5 | 11244030220334011 |
6 | 232233031421311 |
7 | 20351655545224 |
oct | 2733045134653 |
9 | 636303252607 |
10 | 201202121131 |
11 | 78369396640 |
12 | 32bb2224837 |
13 | 15c863a6c5b |
14 | 9a49a0424b |
15 | 5378c7d471 |
hex | 2ed894b9ab |
201202121131 has 4 divisors (see below), whose sum is σ = 219493223064. Its totient is φ = 182911019200.
The previous prime is 201202121119. The next prime is 201202121143. The reversal of 201202121131 is 131121202102.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (201202121119) and next prime (201202121143).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201202121131 is a prime.
It is a super-2 number, since 2×2012021211312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201202121101) 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, 9145550950 + ... + 9145550971.
It is an arithmetic number, because the mean of its divisors is an integer number (54873305766).
Almost surely, 2201202121131 is an apocalyptic number.
201202121131 is a deficient number, since it is larger than the sum of its proper divisors (18291101933).
201202121131 is a wasteful number, since it uses less digits than its factorization.
201202121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18291101932.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 201202121131 its reverse (131121202102), we get a palindrome (332323323233).
The spelling of 201202121131 in words is "two hundred one billion, two hundred two million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •