Base | Representation |
---|---|
bin | 10010101110000111… |
… | …00111011111010001 |
3 | 221221102210022212112 |
4 | 21113003213133101 |
5 | 131040412004221 |
6 | 4341145035105 |
7 | 504026562623 |
oct | 112703473721 |
9 | 27842708775 |
10 | 10050500561 |
11 | 4298277912 |
12 | 1b45a85a95 |
13 | c422bc66a |
14 | 6b4b4ac13 |
15 | 3dc53615b |
hex | 2570e77d1 |
10050500561 has 2 divisors, whose sum is σ = 10050500562. Its totient is φ = 10050500560.
The previous prime is 10050500527. The next prime is 10050500563. The reversal of 10050500561 is 16500505001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5189761600 + 4860738961 = 72040^2 + 69719^2 .
It is an emirp because it is prime and its reverse (16500505001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10050500561 - 218 = 10050238417 is a prime.
It is a super-2 number, since 2×100505005612 (a number of 21 digits) contains 22 as substring.
Together with 10050500563, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10050500563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5025250280 + 5025250281.
It is an arithmetic number, because the mean of its divisors is an integer number (5025250281).
Almost surely, 210050500561 is an apocalyptic number.
It is an amenable number.
10050500561 is a deficient number, since it is larger than the sum of its proper divisors (1).
10050500561 is an equidigital number, since it uses as much as digits as its factorization.
10050500561 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 23.
The spelling of 10050500561 in words is "ten billion, fifty million, five hundred thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •