Base | Representation |
---|---|
bin | 11110000110110… |
… | …011101100110101 |
3 | 1022012102210110111 |
4 | 132012303230311 |
5 | 2013301213414 |
6 | 122042023021 |
7 | 15342200662 |
oct | 3606635465 |
9 | 1265383414 |
10 | 505101109 |
11 | 23a130a37 |
12 | 1211a7a71 |
13 | 8084cbc6 |
14 | 4b122a69 |
15 | 2e5248c4 |
hex | 1e1b3b35 |
505101109 has 2 divisors, whose sum is σ = 505101110. Its totient is φ = 505101108.
The previous prime is 505101083. The next prime is 505101131. The reversal of 505101109 is 901101505.
It is an a-pointer prime, because the next prime (505101131) can be obtained adding 505101109 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 425266884 + 79834225 = 20622^2 + 8935^2 .
It is a cyclic number.
It is not a de Polignac number, because 505101109 - 221 = 503003957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 505101109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (505101139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252550554 + 252550555.
It is an arithmetic number, because the mean of its divisors is an integer number (252550555).
Almost surely, 2505101109 is an apocalyptic number.
It is an amenable number.
505101109 is a deficient number, since it is larger than the sum of its proper divisors (1).
505101109 is an equidigital number, since it uses as much as digits as its factorization.
505101109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 225, while the sum is 22.
The square root of 505101109 is about 22474.4545873754. The cubic root of 505101109 is about 796.3905670883.
The spelling of 505101109 in words is "five hundred five million, one hundred one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •