Base | Representation |
---|---|
bin | 100100101111100110000… |
… | …0101001111110000001101 |
3 | 122212202221220200202110222 |
4 | 1021133030011033300031 |
5 | 1130214410142000414 |
6 | 14423535351041125 |
7 | 1030564652666351 |
oct | 111371405176015 |
9 | 18782856622428 |
10 | 5050010500109 |
11 | 1677774301493 |
12 | 6968863701a5 |
13 | 2a82a206c373 |
14 | 1365c964b461 |
15 | 8b567e8c68e |
hex | 497cc14fc0d |
5050010500109 has 2 divisors, whose sum is σ = 5050010500110. Its totient is φ = 5050010500108.
The previous prime is 5050010500069. The next prime is 5050010500123. The reversal of 5050010500109 is 9010050100505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2623113877609 + 2426896622500 = 1619603^2 + 1557850^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050010500109 - 220 = 5050009451533 is a prime.
It is a super-2 number, since 2×50500105001092 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5050010500159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525005250054 + 2525005250055.
It is an arithmetic number, because the mean of its divisors is an integer number (2525005250055).
Almost surely, 25050010500109 is an apocalyptic number.
It is an amenable number.
5050010500109 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050010500109 is an equidigital number, since it uses as much as digits as its factorization.
5050010500109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1125, while the sum is 26.
The spelling of 5050010500109 in words is "five trillion, fifty billion, ten million, five hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •