Base | Representation |
---|---|
bin | 1110101101100100111… |
… | …10011100101101100101 |
3 | 1210022210112210002110010 |
4 | 13112302132130231211 |
5 | 31240233402000010 |
6 | 1024120453120433 |
7 | 51343616565642 |
oct | 7266236345545 |
9 | 1708715702403 |
10 | 505505500005 |
11 | 185424749100 |
12 | 81b78929119 |
13 | 38890938c9c |
14 | 1a6764acdc9 |
15 | d23913c620 |
hex | 75b279cb65 |
505505500005 has 48 divisors (see below), whose sum is σ = 889214719680. Its totient is φ = 245040238080.
The previous prime is 505505499971. The next prime is 505505500043. The reversal of 505505500005 is 500005505505.
It is not a de Polignac number, because 505505500005 - 28 = 505505499749 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 47 ways as a sum of consecutive naturals, for example, 9063534 + ... + 9119136.
It is an arithmetic number, because the mean of its divisors is an integer number (18525306660).
Almost surely, 2505505500005 is an apocalyptic number.
505505500005 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
505505500005 is a deficient number, since it is larger than the sum of its proper divisors (383709219675).
505505500005 is a wasteful number, since it uses less digits than its factorization.
505505500005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60642 (or 60631 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 30.
It can be divided in two parts, 50550 and 5500005, that added together give a palindrome (5550555).
The spelling of 505505500005 in words is "five hundred five billion, five hundred five million, five hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •