Base | Representation |
---|---|
bin | 100100011010101000101… |
… | …0001101110001100111101 |
3 | 122201110210002102211212222 |
4 | 1020311101101232030331 |
5 | 1124000220112000104 |
6 | 14351133202335125 |
7 | 1024412402211335 |
oct | 110652121561475 |
9 | 18643702384788 |
10 | 5005000500029 |
11 | 165a677336212 |
12 | 68a00465a4a5 |
13 | 2a3c7b06961a |
14 | 1343599380c5 |
15 | 8a2d17261be |
hex | 48d5146e33d |
5005000500029 has 8 divisors (see below), whose sum is σ = 5021076769272. Its totient is φ = 4988924778240.
The previous prime is 5005000500001. The next prime is 5005000500037. The reversal of 5005000500029 is 9200050005005.
It can be written as a sum of positive squares in 4 ways, for example, as 2777500804 + 5002222999225 = 52702^2 + 2236565^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 5005000500029 - 212 = 5005000495933 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5005000499980 and 5005000500007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5005000560029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26435867 + ... + 26624519.
It is an arithmetic number, because the mean of its divisors is an integer number (627634596159).
Almost surely, 25005000500029 is an apocalyptic number.
It is an amenable number.
5005000500029 is a deficient number, since it is larger than the sum of its proper divisors (16076269243).
5005000500029 is a wasteful number, since it uses less digits than its factorization.
5005000500029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273727.
The product of its (nonzero) digits is 2250, while the sum is 26.
The spelling of 5005000500029 in words is "five trillion, five billion, five hundred thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •