Base | Representation |
---|---|
bin | 1110101101110000111… |
… | …10000001000100001101 |
3 | 1210100001112222120012021 |
4 | 13112320132001010031 |
5 | 31240440122100221 |
6 | 1024134444210141 |
7 | 51346250341540 |
oct | 7267036010415 |
9 | 1710045876167 |
10 | 505606050061 |
11 | 185476485922 |
12 | 81ba6539951 |
13 | 388a8712c68 |
14 | 1a6859a4857 |
15 | d242da0041 |
hex | 75b878110d |
505606050061 has 4 divisors (see below), whose sum is σ = 577835485792. Its totient is φ = 433376614332.
The previous prime is 505606049981. The next prime is 505606050091. The reversal of 505606050061 is 160050606505.
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 not a de Polignac number, because 505606050061 - 29 = 505606049549 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505606049999 and 505606050026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505606050091) 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, 36114717855 + ... + 36114717868.
It is an arithmetic number, because the mean of its divisors is an integer number (144458871448).
Almost surely, 2505606050061 is an apocalyptic number.
It is an amenable number.
505606050061 is a deficient number, since it is larger than the sum of its proper divisors (72229435731).
505606050061 is an equidigital number, since it uses as much as digits as its factorization.
505606050061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72229435730.
The product of its (nonzero) digits is 27000, while the sum is 34.
Adding to 505606050061 its reverse (160050606505), we get a palindrome (665656656566).
The spelling of 505606050061 in words is "five hundred five billion, six hundred six million, fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •