Base | Representation |
---|---|
bin | 101110100100110101… |
… | …000001111000001101 |
3 | 11210002021122110220121 |
4 | 232210311001320031 |
5 | 1304410030130010 |
6 | 34550235544541 |
7 | 3420203012602 |
oct | 564465017015 |
9 | 153067573817 |
10 | 50010005005 |
11 | 1a233386a54 |
12 | 98382bb151 |
13 | 493cb6394c |
14 | 25c5bb66a9 |
15 | 147a6be3da |
hex | ba4d41e0d |
50010005005 has 8 divisors (see below), whose sum is σ = 60025680792. Its totient is φ = 39998887488.
The previous prime is 50010004991. The next prime is 50010005033. The reversal of 50010005005 is 50050001005.
It can be written as a sum of positive squares in 4 ways, for example, as 7430095204 + 42579909801 = 86198^2 + 206349^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50010005005 - 29 = 50010004493 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 50010005005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1115382 + ... + 1159351.
It is an arithmetic number, because the mean of its divisors is an integer number (7503210099).
Almost surely, 250010005005 is an apocalyptic number.
It is an amenable number.
50010005005 is a deficient number, since it is larger than the sum of its proper divisors (10015675787).
50010005005 is a wasteful number, since it uses less digits than its factorization.
50010005005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2279135.
The product of its (nonzero) digits is 125, while the sum is 16.
It can be divided in two parts, 5001000 and 5005, that added together give a palindrome (5006005).
The spelling of 50010005005 in words is "fifty billion, ten million, five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •