Base | Representation |
---|---|
bin | 1001010100000100… |
… | …11100001010010101 |
3 | 110220110212000111122 |
4 | 10222002130022111 |
5 | 40220031000010 |
6 | 2144100413325 |
7 | 234624265232 |
oct | 45202341225 |
9 | 13813760448 |
10 | 5000250005 |
11 | 2136568923 |
12 | b766a7245 |
13 | 618c1861a |
14 | 356128789 |
15 | 1e3ea5855 |
hex | 12a09c295 |
5000250005 has 4 divisors (see below), whose sum is σ = 6000300012. Its totient is φ = 4000200000.
The previous prime is 5000249963. The next prime is 5000250011. The reversal of 5000250005 is 5000520005.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3108174001 + 1892076004 = 55751^2 + 43498^2 .
It is a de Polignac number, because none of the positive numbers 2k-5000250005 is a prime.
It is a super-2 number, since 2×50002500052 = 50005000225005000050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500024996 + ... + 500025005.
It is an arithmetic number, because the mean of its divisors is an integer number (1500075003).
Almost surely, 25000250005 is an apocalyptic number.
It is an amenable number.
5000250005 is a deficient number, since it is larger than the sum of its proper divisors (1000050007).
5000250005 is a wasteful number, since it uses less digits than its factorization.
5000250005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000050006.
The product of its (nonzero) digits is 250, while the sum is 17.
The square root of 5000250005 is about 70712.4458988656. The cubic root of 5000250005 is about 1710.0044463708.
The spelling of 5000250005 in words is "five billion, two hundred fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •