Base | Representation |
---|---|
bin | 1110101100110101111… |
… | …01100101110100000001 |
3 | 1210021210001110221122222 |
4 | 13112122331211310001 |
5 | 31233431404314221 |
6 | 1024013401540425 |
7 | 51331056514643 |
oct | 7263275456401 |
9 | 1707701427588 |
10 | 505111010561 |
11 | 185241aa7373 |
12 | 81a887a4715 |
13 | 38829ca6991 |
14 | 1a639d40893 |
15 | d2146b69ab |
hex | 759af65d01 |
505111010561 has 2 divisors, whose sum is σ = 505111010562. Its totient is φ = 505111010560.
The previous prime is 505111010549. The next prime is 505111010567. The reversal of 505111010561 is 165010111505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 487958131600 + 17152878961 = 698540^2 + 130969^2 .
It is a cyclic number.
It is not a de Polignac number, because 505111010561 - 26 = 505111010497 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 505111010561.
It is not a weakly prime, because it can be changed into another prime (505111010567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252555505280 + 252555505281.
It is an arithmetic number, because the mean of its divisors is an integer number (252555505281).
Almost surely, 2505111010561 is an apocalyptic number.
It is an amenable number.
505111010561 is a deficient number, since it is larger than the sum of its proper divisors (1).
505111010561 is an equidigital number, since it uses as much as digits as its factorization.
505111010561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 750, while the sum is 26.
The spelling of 505111010561 in words is "five hundred five billion, one hundred eleven million, ten thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •