Base | Representation |
---|---|
bin | 100100011101100000011… |
… | …0011011001001011101101 |
3 | 122202001200210222102000102 |
4 | 1020323000303121023231 |
5 | 1124100332120040401 |
6 | 14354033110440445 |
7 | 1025021243666414 |
oct | 110730063311355 |
9 | 18661623872012 |
10 | 5011166565101 |
11 | 1662250981164 |
12 | 68b245663125 |
13 | 2a472166a638 |
14 | 13478281447b |
15 | 8a542c1356b |
hex | 48ec0cd92ed |
5011166565101 has 2 divisors, whose sum is σ = 5011166565102. Its totient is φ = 5011166565100.
The previous prime is 5011166565047. The next prime is 5011166565103. The reversal of 5011166565101 is 1015656611105.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5005735022500 + 5431542601 = 2237350^2 + 73699^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5011166565101 is a prime.
It is a super-2 number, since 2×50111665651012 (a number of 26 digits) contains 22 as substring.
Together with 5011166565103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5011166565103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2505583282550 + 2505583282551.
It is an arithmetic number, because the mean of its divisors is an integer number (2505583282551).
Almost surely, 25011166565101 is an apocalyptic number.
It is an amenable number.
5011166565101 is a deficient number, since it is larger than the sum of its proper divisors (1).
5011166565101 is an equidigital number, since it uses as much as digits as its factorization.
5011166565101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 38.
The spelling of 5011166565101 in words is "five trillion, eleven billion, one hundred sixty-six million, five hundred sixty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •