Base | Representation |
---|---|
bin | 1110101100101001010… |
… | …11000110011010010101 |
3 | 1210021111200221110110101 |
4 | 13112110223012122111 |
5 | 31233222402000203 |
6 | 1023555112254101 |
7 | 51325335632065 |
oct | 7262453063225 |
9 | 1707450843411 |
10 | 505005500053 |
11 | 1851984917aa |
12 | 81a593a1331 |
13 | 38811183c22 |
14 | 1a629d173a5 |
15 | d20a2c441d |
hex | 7594ac6695 |
505005500053 has 4 divisors (see below), whose sum is σ = 505902490848. Its totient is φ = 504108509260.
The previous prime is 505005500039. The next prime is 505005500057. The reversal of 505005500053 is 350005500505.
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, and also an emirpimes, since its reverse is a distinct semiprime: 350005500505 = 5 ⋅70001100101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-505005500053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505005499994 and 505005500030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505005500057) 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, 448494553 + ... + 448495678.
It is an arithmetic number, because the mean of its divisors is an integer number (126475622712).
Almost surely, 2505005500053 is an apocalyptic number.
It is an amenable number.
505005500053 is a deficient number, since it is larger than the sum of its proper divisors (896990795).
505005500053 is an equidigital number, since it uses as much as digits as its factorization.
505005500053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 896990794.
The product of its (nonzero) digits is 9375, while the sum is 28.
The spelling of 505005500053 in words is "five hundred five billion, five million, five hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •