Base | Representation |
---|---|
bin | 11110000110110… |
… | …011011100010101 |
3 | 1022012102202000101 |
4 | 132012303130111 |
5 | 2013301200203 |
6 | 122042014101 |
7 | 15342164623 |
oct | 3606633425 |
9 | 1265382011 |
10 | 505100053 |
11 | 23a130167 |
12 | 1211a7331 |
13 | 8084c593 |
14 | 4b122513 |
15 | 2e52441d |
hex | 1e1b3715 |
505100053 has 2 divisors, whose sum is σ = 505100054. Its totient is φ = 505100052.
The previous prime is 505100051. The next prime is 505100083. The reversal of 505100053 is 350001505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 290975364 + 214124689 = 17058^2 + 14633^2 .
It is a cyclic number.
It is not a de Polignac number, because 505100053 - 21 = 505100051 is a prime.
Together with 505100051, it forms a pair of twin primes.
It is equal to p26610004 and since 505100053 and 26610004 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 505100053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (505100051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252550026 + 252550027.
It is an arithmetic number, because the mean of its divisors is an integer number (252550027).
Almost surely, 2505100053 is an apocalyptic number.
It is an amenable number.
505100053 is a deficient number, since it is larger than the sum of its proper divisors (1).
505100053 is an equidigital number, since it uses as much as digits as its factorization.
505100053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 375, while the sum is 19.
The square root of 505100053 is about 22474.4310940233. The cubic root of 505100053 is about 796.3900120911.
Adding to 505100053 its reverse (350001505), we get a palindrome (855101558).
The spelling of 505100053 in words is "five hundred five million, one hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •