Base | Representation |
---|---|
bin | 1110101101110001100… |
… | …00111001110011100101 |
3 | 1210100001220022002200122 |
4 | 13112320300321303211 |
5 | 31240442404013221 |
6 | 1024135142251325 |
7 | 51346340412125 |
oct | 7267060716345 |
9 | 1710056262618 |
10 | 505611001061 |
11 | 185479257661 |
12 | 81ba8126b45 |
13 | 388a975764a |
14 | 1a6864d2c85 |
15 | d24352beab |
hex | 75b8c39ce5 |
505611001061 has 4 divisors (see below), whose sum is σ = 532222106400. Its totient is φ = 478999895724.
The previous prime is 505611001009. The next prime is 505611001111. The reversal of 505611001061 is 160100116505.
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 505611001061 - 238 = 230733094117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 505611001061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505611061061) 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, 13305552641 + ... + 13305552678.
It is an arithmetic number, because the mean of its divisors is an integer number (133055526600).
Almost surely, 2505611001061 is an apocalyptic number.
It is an amenable number.
505611001061 is a deficient number, since it is larger than the sum of its proper divisors (26611105339).
505611001061 is a wasteful number, since it uses less digits than its factorization.
505611001061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26611105338.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 505611001061 its reverse (160100116505), we get a palindrome (665711117566).
The spelling of 505611001061 in words is "five hundred five billion, six hundred eleven million, one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •