Base | Representation |
---|---|
bin | 1001100001101000… |
… | …11000011000100111 |
3 | 111012101220101001202 |
4 | 10300310120120213 |
5 | 40433141130111 |
6 | 2203242513115 |
7 | 240505216442 |
oct | 46064303047 |
9 | 14171811052 |
10 | 5114005031 |
11 | 21947a4743 |
12 | ba880579b |
13 | 636666ba5 |
14 | 36729a659 |
15 | 1ede75b3b |
hex | 130d18627 |
5114005031 has 4 divisors (see below), whose sum is σ = 5125195872. Its totient is φ = 5102814192.
The previous prime is 5114004977. The next prime is 5114005049. The reversal of 5114005031 is 1305004115.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5114005031 is a prime.
It is a super-2 number, since 2×51140050312 = 52306094914186621922, 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 = 5114004994 and 5114005012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5114005051) 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, 5594735 + ... + 5595648.
It is an arithmetic number, because the mean of its divisors is an integer number (1281298968).
Almost surely, 25114005031 is an apocalyptic number.
5114005031 is a deficient number, since it is larger than the sum of its proper divisors (11190841).
5114005031 is a wasteful number, since it uses less digits than its factorization.
5114005031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11190840.
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 5114005031 is about 71512.2718909139. The cubic root of 5114005031 is about 1722.8747929915.
Adding to 5114005031 its reverse (1305004115), we get a palindrome (6419009146).
The spelling of 5114005031 in words is "five billion, one hundred fourteen million, five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •