Base | Representation |
---|---|
bin | 101110100111001101… |
… | …100111100000001101 |
3 | 11210012001220200121002 |
4 | 232213031213200031 |
5 | 1310000300130010 |
6 | 34554225150045 |
7 | 3421200010640 |
oct | 564715474015 |
9 | 153161820532 |
10 | 50050005005 |
11 | 1a253a17600 |
12 | 984978b325 |
13 | 494822a4a0 |
14 | 25cb229a57 |
15 | 147de711a5 |
hex | ba736780d |
50050005005 has 48 divisors (see below), whose sum is σ = 81251006592. Its totient is φ = 28799971200.
The previous prime is 50050004999. The next prime is 50050005007.
It is a happy number.
50050005005 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 50050005005 - 212 = 50050000909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50050005007) 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 47 ways as a sum of consecutive naturals, for example, 399491 + ... + 509600.
It is an arithmetic number, because the mean of its divisors is an integer number (1692729304).
Almost surely, 250050005005 is an apocalyptic number.
50050005005 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50050005005 is a deficient number, since it is larger than the sum of its proper divisors (31201001587).
50050005005 is a wasteful number, since it uses less digits than its factorization.
50050005005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909138 (or 909127 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 20.
The spelling of 50050005005 in words is "fifty billion, fifty million, five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •