Base | Representation |
---|---|
bin | 1001011000110100… |
… | …00101000111111011 |
3 | 111000020122121100101 |
4 | 10230122011013323 |
5 | 40310220022111 |
6 | 2152040420231 |
7 | 235616210005 |
oct | 45432050773 |
9 | 14006577311 |
10 | 5040001531 |
11 | 2156a49824 |
12 | b87a77677 |
13 | 624226036 |
14 | 35b515375 |
15 | 1e7708bc1 |
hex | 12c6851fb |
5040001531 has 2 divisors, whose sum is σ = 5040001532. Its totient is φ = 5040001530.
The previous prime is 5040001529. The next prime is 5040001567. The reversal of 5040001531 is 1351000405.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5040001531 - 21 = 5040001529 is a prime.
It is a super-2 number, since 2×50400015312 = 50803230864964687922, which contains 22 as substring.
Together with 5040001529, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5040001499 and 5040001508.
It is not a weakly prime, because it can be changed into another prime (5040001511) 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, 2520000765 + 2520000766.
It is an arithmetic number, because the mean of its divisors is an integer number (2520000766).
Almost surely, 25040001531 is an apocalyptic number.
5040001531 is a deficient number, since it is larger than the sum of its proper divisors (1).
5040001531 is an equidigital number, since it uses as much as digits as its factorization.
5040001531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 5040001531 is about 70992.9681799543. The cubic root of 5040001531 is about 1714.5239500695.
Adding to 5040001531 its reverse (1351000405), we get a palindrome (6391001936).
The spelling of 5040001531 in words is "five billion, forty million, one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •