Base | Representation |
---|---|
bin | 100100011010101000110… |
… | …0010111010000011001101 |
3 | 122201110210101220201112221 |
4 | 1020311101202322003031 |
5 | 1124000222240130010 |
6 | 14351133443055341 |
7 | 1024412455413355 |
oct | 110652142720315 |
9 | 18643711821487 |
10 | 5005005005005 |
11 | 165a679932935 |
12 | 68a006071551 |
13 | 2a3c7bc85ca5 |
14 | 13435a38bb65 |
15 | 8a2d1d15dda |
hex | 48d518ba0cd |
5005005005005 has 32 divisors (see below), whose sum is σ = 6374398980096. Its totient is φ = 3766383360000.
The previous prime is 5005005004919. The next prime is 5005005005027.
5005005005005 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5005005005005 - 211 = 5005005002957 is a prime.
5005005005005 is a modest number, since divided by 5005005 gives 5005 as remainder.
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 31 ways as a sum of consecutive naturals, for example, 269125 + ... + 3175285.
It is an arithmetic number, because the mean of its divisors is an integer number (199199968128).
Almost surely, 25005005005005 is an apocalyptic number.
It is an amenable number.
5005005005005 is a deficient number, since it is larger than the sum of its proper divisors (1369393975091).
5005005005005 is a wasteful number, since it uses less digits than its factorization.
5005005005005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906509.
The product of its (nonzero) digits is 3125, while the sum is 25.
The spelling of 5005005005005 in words is "five trillion, five billion, five million, five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •