Base | Representation |
---|---|
bin | 100100011010101010001… |
… | …0000011101001110100101 |
3 | 122201110220120112002221221 |
4 | 1020311110100131032211 |
5 | 1124000320412000010 |
6 | 14351142150140341 |
7 | 1024413550206013 |
oct | 110652420351645 |
9 | 18643816462857 |
10 | 5005050500005 |
11 | 165a6a2586a06 |
12 | 68a0193516b1 |
13 | 2a3c885249ca |
14 | 1343624318b3 |
15 | 8a2d5d00dda |
hex | 48d5441d3a5 |
5005050500005 has 4 divisors (see below), whose sum is σ = 6006060600012. Its totient is φ = 4004040400000.
The previous prime is 5005050499991. The next prime is 5005050500057. The reversal of 5005050500005 is 5000050505005.
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 1675093416516 + 3329957083489 = 1294254^2 + 1824817^2 .
It is not a de Polignac number, because 5005050500005 - 25 = 5005050499973 is a prime.
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 (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500505049996 + ... + 500505050005.
It is an arithmetic number, because the mean of its divisors is an integer number (1501515150003).
Almost surely, 25005050500005 is an apocalyptic number.
It is an amenable number.
5005050500005 is a deficient number, since it is larger than the sum of its proper divisors (1001010100007).
5005050500005 is a wasteful number, since it uses less digits than its factorization.
5005050500005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001010100006.
The product of its (nonzero) digits is 3125, while the sum is 25.
It can be divided in two parts, 5005050 and 500005, that added together give a palindrome (5505055).
The spelling of 5005050500005 in words is "five trillion, five billion, fifty million, five hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •