Base | Representation |
---|---|
bin | 1011110101110100001… |
… | …0001000010000110011 |
3 | 201110001222201020221021 |
4 | 2331131002020100303 |
5 | 11313103110132011 |
6 | 233241332440311 |
7 | 20461021016101 |
oct | 2753502102063 |
9 | 643058636837 |
10 | 203424302131 |
11 | 792a9796066 |
12 | 33512479097 |
13 | 1624b8a365b |
14 | 9bbabb6c71 |
15 | 5458dcc471 |
hex | 2f5d088433 |
203424302131 has 2 divisors, whose sum is σ = 203424302132. Its totient is φ = 203424302130.
The previous prime is 203424302129. The next prime is 203424302141. The reversal of 203424302131 is 131203424302.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 203424302131 - 21 = 203424302129 is a prime.
It is a super-2 number, since 2×2034243021312 (a number of 23 digits) contains 22 as substring.
Together with 203424302129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 203424302096 and 203424302105.
It is not a weakly prime, because it can be changed into another prime (203424302141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101712151065 + 101712151066.
It is an arithmetic number, because the mean of its divisors is an integer number (101712151066).
Almost surely, 2203424302131 is an apocalyptic number.
203424302131 is a deficient number, since it is larger than the sum of its proper divisors (1).
203424302131 is an equidigital number, since it uses as much as digits as its factorization.
203424302131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 203424302131 its reverse (131203424302), we get a palindrome (334627726433).
The spelling of 203424302131 in words is "two hundred three billion, four hundred twenty-four million, three hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •