Base | Representation |
---|---|
bin | 1011110001010111101… |
… | …1001110101100011011 |
3 | 201022222211220000221102 |
4 | 2330111323032230123 |
5 | 11303132203424011 |
6 | 232523114502015 |
7 | 20416323532163 |
oct | 2742573165433 |
9 | 638884800842 |
10 | 202231311131 |
11 | 78847337293 |
12 | 3323aa3490b |
13 | 160bb694515 |
14 | 9b0658d5a3 |
15 | 53d92c873b |
hex | 2f15eceb1b |
202231311131 has 4 divisors (see below), whose sum is σ = 202327112064. Its totient is φ = 202135510200.
The previous prime is 202231311127. The next prime is 202231311179. The reversal of 202231311131 is 131113132202.
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 202231311131 - 22 = 202231311127 is a prime.
It is a super-2 number, since 2×2022313111312 (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 (202231310131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47897300 + ... + 47901521.
It is an arithmetic number, because the mean of its divisors is an integer number (50581778016).
Almost surely, 2202231311131 is an apocalyptic number.
202231311131 is a deficient number, since it is larger than the sum of its proper divisors (95800933).
202231311131 is an equidigital number, since it uses as much as digits as its factorization.
202231311131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95800932.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 202231311131 its reverse (131113132202), we get a palindrome (333344443333).
The spelling of 202231311131 in words is "two hundred two billion, two hundred thirty-one million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •