Base | Representation |
---|---|
bin | 1110101100101000110… |
… | …00000011000010011101 |
3 | 1210021111100112201012222 |
4 | 13112110120003002131 |
5 | 31233220112134001 |
6 | 1023554413235125 |
7 | 51325245320522 |
oct | 7262430030235 |
9 | 1707440481188 |
10 | 505000505501 |
11 | 185195690278 |
12 | 81a57792aa5 |
13 | 3881012577b |
14 | 1a6293b7149 |
15 | d209b3961b |
hex | 759460309d |
505000505501 has 4 divisors (see below), whose sum is σ = 505232265600. Its totient is φ = 504768745404.
The previous prime is 505000505473. The next prime is 505000505519. The reversal of 505000505501 is 105505000505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-505000505501 is a prime.
It is a super-2 number, since 2×5050005055012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505000595501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 115876781 + ... + 115881138.
It is an arithmetic number, because the mean of its divisors is an integer number (126308066400).
Almost surely, 2505000505501 is an apocalyptic number.
It is an amenable number.
505000505501 is a deficient number, since it is larger than the sum of its proper divisors (231760099).
505000505501 is a wasteful number, since it uses less digits than its factorization.
505000505501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231760098.
The product of its (nonzero) digits is 3125, while the sum is 26.
The spelling of 505000505501 in words is "five hundred five billion, five hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •