Base | Representation |
---|---|
bin | 1011110001010111101… |
… | …0001010100101000011 |
3 | 201022222211100212020002 |
4 | 2330111322022211003 |
5 | 11303132121012011 |
6 | 232523104510215 |
7 | 20416321260602 |
oct | 2742572124503 |
9 | 638884325202 |
10 | 202231032131 |
11 | 78847166707 |
12 | 3323a91b36b |
13 | 160bb5c752b |
14 | 9b06519a39 |
15 | 53d9270c3b |
hex | 2f15e8a943 |
202231032131 has 2 divisors, whose sum is σ = 202231032132. Its totient is φ = 202231032130.
The previous prime is 202231032023. The next prime is 202231032163. The reversal of 202231032131 is 131230132202.
202231032131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202231032131 - 214 = 202231015747 is a prime.
It is a super-2 number, since 2×2022310321312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (202231032931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101115516065 + 101115516066.
It is an arithmetic number, because the mean of its divisors is an integer number (101115516066).
Almost surely, 2202231032131 is an apocalyptic number.
202231032131 is a deficient number, since it is larger than the sum of its proper divisors (1).
202231032131 is an equidigital number, since it uses as much as digits as its factorization.
202231032131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 202231032131 its reverse (131230132202), we get a palindrome (333461164333).
The spelling of 202231032131 in words is "two hundred two billion, two hundred thirty-one million, thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •