Base | Representation |
---|---|
bin | 101110100100101110… |
… | …110101001001100101 |
3 | 11210002011120220211102 |
4 | 232210232311021211 |
5 | 1304404121130010 |
6 | 34550141045445 |
7 | 3420153134153 |
oct | 564456651145 |
9 | 153064526742 |
10 | 50008380005 |
11 | 1a232477081 |
12 | 9837856885 |
13 | 493c7150cc |
14 | 25c58b23d3 |
15 | 147a49cba5 |
hex | ba4bb5265 |
50008380005 has 4 divisors (see below), whose sum is σ = 60010056012. Its totient is φ = 40006704000.
The previous prime is 50008380001. The next prime is 50008380011.
50008380005 is nontrivially palindromic in base 10.
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 26080312036 + 23928067969 = 161494^2 + 154687^2 .
It is not a de Polignac number, because 50008380005 - 22 = 50008380001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50008380005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50008380001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5000837996 + ... + 5000838005.
It is an arithmetic number, because the mean of its divisors is an integer number (15002514003).
Almost surely, 250008380005 is an apocalyptic number.
It is an amenable number.
50008380005 is a deficient number, since it is larger than the sum of its proper divisors (10001676007).
50008380005 is a wasteful number, since it uses less digits than its factorization.
50008380005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10001676006.
The product of its (nonzero) digits is 4800, while the sum is 29.
The spelling of 50008380005 in words is "fifty billion, eight million, three hundred eighty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •