Base | Representation |
---|---|
bin | 1001100100110001… |
… | …00000010101111111 |
3 | 111021020021212011212 |
4 | 10302120200111333 |
5 | 41011401031111 |
6 | 2210021235035 |
7 | 241244264345 |
oct | 46230402577 |
9 | 14236255155 |
10 | 5140252031 |
11 | 21a85a1482 |
12 | bb5562a7b |
13 | 63bc26865 |
14 | 36a96d995 |
15 | 20140c98b |
hex | 13262057f |
5140252031 has 4 divisors (see below), whose sum is σ = 5143282752. Its totient is φ = 5137221312.
The previous prime is 5140252027. The next prime is 5140252081. The reversal of 5140252031 is 1302520415.
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 5140252031 - 22 = 5140252027 is a prime.
It is a super-2 number, since 2×51402520312 = 52844381884399249922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5140251988 and 5140252006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5140252021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1512815 + ... + 1516208.
It is an arithmetic number, because the mean of its divisors is an integer number (1285820688).
Almost surely, 25140252031 is an apocalyptic number.
5140252031 is a deficient number, since it is larger than the sum of its proper divisors (3030721).
5140252031 is a wasteful number, since it uses less digits than its factorization.
5140252031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3030720.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 5140252031 is about 71695.5509847020. The cubic root of 5140252031 is about 1725.8172455783.
Adding to 5140252031 its reverse (1302520415), we get a palindrome (6442772446).
The spelling of 5140252031 in words is "five billion, one hundred forty million, two hundred fifty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •