Base | Representation |
---|---|
bin | 1001011010001000… |
… | …11110001000101111 |
3 | 111001000120011211110 |
4 | 10231010132020233 |
5 | 40321041122111 |
6 | 2153114523103 |
7 | 236112521655 |
oct | 45504361057 |
9 | 14030504743 |
10 | 5051114031 |
11 | 2162249807 |
12 | b8b736493 |
13 | 626617092 |
14 | 35cba8dd5 |
15 | 1e86a15a6 |
hex | 12d11e22f |
5051114031 has 4 divisors (see below), whose sum is σ = 6734818712. Its totient is φ = 3367409352.
The previous prime is 5051114009. The next prime is 5051114051. The reversal of 5051114031 is 1304111505.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5051114031 - 218 = 5050851887 is a prime.
It is a super-2 number, since 2×50511140312 = 51027505908330137922, 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 = 5051113989 and 5051114007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5051114051) 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, 841852336 + ... + 841852341.
It is an arithmetic number, because the mean of its divisors is an integer number (1683704678).
Almost surely, 25051114031 is an apocalyptic number.
5051114031 is a deficient number, since it is larger than the sum of its proper divisors (1683704681).
5051114031 is a wasteful number, since it uses less digits than its factorization.
5051114031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1683704680.
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 5051114031 is about 71071.1898802883. The cubic root of 5051114031 is about 1715.7831204352.
Adding to 5051114031 its reverse (1304111505), we get a palindrome (6355225536).
The spelling of 5051114031 in words is "five billion, fifty-one million, one hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •