Base | Representation |
---|---|
bin | 1110101101100100111… |
… | …00101110110110010101 |
3 | 1210022210111221020011110 |
4 | 13112302130232312111 |
5 | 31240233243100010 |
6 | 1024120435325233 |
7 | 51343613012664 |
oct | 7266234566625 |
9 | 1708714836143 |
10 | 505505050005 |
11 | 185424470aaa |
12 | 81b78750819 |
13 | 3889080c207 |
14 | 1a6763d2ddb |
15 | d23909e120 |
hex | 75b272ed95 |
505505050005 has 32 divisors (see below), whose sum is σ = 845820681984. Its totient is φ = 257316466176.
The previous prime is 505505049997. The next prime is 505505050021. The reversal of 505505050005 is 500050505505.
It is not a de Polignac number, because 505505050005 - 23 = 505505049997 is a prime.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1445434 + ... + 1760763.
It is an arithmetic number, because the mean of its divisors is an integer number (26431896312).
Almost surely, 2505505050005 is an apocalyptic number.
It is an amenable number.
505505050005 is a deficient number, since it is larger than the sum of its proper divisors (340315631979).
505505050005 is a wasteful number, since it uses less digits than its factorization.
505505050005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3206685.
The product of its (nonzero) digits is 15625, while the sum is 30.
The spelling of 505505050005 in words is "five hundred five billion, five hundred five million, fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •