Base | Representation |
---|---|
bin | 1001011001000101… |
… | …11010001101100011 |
3 | 111000102000012101022 |
4 | 10230202322031203 |
5 | 40311313104011 |
6 | 2152202200055 |
7 | 235644660056 |
oct | 45442721543 |
9 | 14012005338 |
10 | 5042316131 |
11 | 215828a816 |
12 | b887b302b |
13 | 624856718 |
14 | 35b958a9d |
15 | 1e7a148db |
hex | 12c8ba363 |
5042316131 has 2 divisors, whose sum is σ = 5042316132. Its totient is φ = 5042316130.
The previous prime is 5042316113. The next prime is 5042316137. The reversal of 5042316131 is 1316132405.
Together with previous prime (5042316113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5042316131 - 214 = 5042299747 is a prime.
It is a super-2 number, since 2×50423161312 = 50849903929885618322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5042316131.
It is not a weakly prime, because it can be changed into another prime (5042316137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2521158065 + 2521158066.
It is an arithmetic number, because the mean of its divisors is an integer number (2521158066).
Almost surely, 25042316131 is an apocalyptic number.
5042316131 is a deficient number, since it is larger than the sum of its proper divisors (1).
5042316131 is an equidigital number, since it uses as much as digits as its factorization.
5042316131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 5042316131 is about 71009.2679232789. The cubic root of 5042316131 is about 1714.7863725952.
Adding to 5042316131 its reverse (1316132405), we get a palindrome (6358448536).
The spelling of 5042316131 in words is "five billion, forty-two million, three hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •