Base | Representation |
---|---|
bin | 1110101100101110101… |
… | …10110010000100011101 |
3 | 1210021121211121222022211 |
4 | 13112113112302010131 |
5 | 31233320412134001 |
6 | 1024003401040421 |
7 | 51326423315233 |
oct | 7262726620435 |
9 | 1707554558284 |
10 | 505050505501 |
11 | 185210930a93 |
12 | 81a70486111 |
13 | 3881a5b0b79 |
14 | 1a631cb0953 |
15 | d20e214351 |
hex | 75975b211d |
505050505501 has 4 divisors (see below), whose sum is σ = 505051957404. Its totient is φ = 505049053600.
The previous prime is 505050505489. The next prime is 505050505543. The reversal of 505050505501 is 105505050505.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 325956497476 + 179094008025 = 570926^2 + 423195^2 .
It is a cyclic number.
It is not a de Polignac number, because 505050505501 - 27 = 505050505373 is a prime.
It is a super-2 number, since 2×5050505055012 (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 (505051505501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 140721 + ... + 1014841.
It is an arithmetic number, because the mean of its divisors is an integer number (126262989351).
Almost surely, 2505050505501 is an apocalyptic number.
It is an amenable number.
505050505501 is a deficient number, since it is larger than the sum of its proper divisors (1451903).
505050505501 is an equidigital number, since it uses as much as digits as its factorization.
505050505501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1451902.
The product of its (nonzero) digits is 15625, while the sum is 31.
The spelling of 505050505501 in words is "five hundred five billion, fifty million, five hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •