Base | Representation |
---|---|
bin | 1001110001110111… |
… | …00101001010110011 |
3 | 111112220000020011101 |
4 | 10320323211022303 |
5 | 41223012011011 |
6 | 2224544025231 |
7 | 244050125350 |
oct | 47073451263 |
9 | 14486006141 |
10 | 5250110131 |
11 | 22546064a2 |
12 | 1026302217 |
13 | 65890c456 |
14 | 37b3a9627 |
15 | 20adad2c1 |
hex | 138ee52b3 |
5250110131 has 4 divisors (see below), whose sum is σ = 6000125872. Its totient is φ = 4500094392.
The previous prime is 5250110087. The next prime is 5250110161. The reversal of 5250110131 is 1310110525.
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 5250110131 - 29 = 5250109619 is a prime.
It is a super-2 number, since 2×52501101312 = 55127312775257674322, 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 = 5250110099 and 5250110108.
It is not an unprimeable number, because it can be changed into a prime (5250110161) 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, 375007860 + ... + 375007873.
It is an arithmetic number, because the mean of its divisors is an integer number (1500031468).
Almost surely, 25250110131 is an apocalyptic number.
5250110131 is a deficient number, since it is larger than the sum of its proper divisors (750015741).
5250110131 is an equidigital number, since it uses as much as digits as its factorization.
5250110131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 750015740.
The product of its (nonzero) digits is 150, while the sum is 19.
The square root of 5250110131 is about 72457.6437030628. The cubic root of 5250110131 is about 1738.0254753198.
Adding to 5250110131 its reverse (1310110525), we get a palindrome (6560220656).
The spelling of 5250110131 in words is "five billion, two hundred fifty million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •