Base | Representation |
---|---|
bin | 101000000110010011111… |
… | …0100000110101011101011 |
3 | 201111212010210122200102112 |
4 | 1100030213310012223223 |
5 | 1210243223404323201 |
6 | 15415434111152535 |
7 | 1106110316446652 |
oct | 120144764065353 |
9 | 21455123580375 |
10 | 5511111011051 |
11 | 1835281545018 |
12 | 75010bb1574b |
13 | 30c907136c99 |
14 | 150a4c4d6199 |
15 | 98553a210bb |
hex | 50327d06aeb |
5511111011051 has 2 divisors, whose sum is σ = 5511111011052. Its totient is φ = 5511111011050.
The previous prime is 5511111011011. The next prime is 5511111011057. The reversal of 5511111011051 is 1501101111155.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5511111011051 - 226 = 5511043902187 is a prime.
It is a super-2 number, since 2×55111110110512 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (5511111011057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2755555505525 + 2755555505526.
It is an arithmetic number, because the mean of its divisors is an integer number (2755555505526).
Almost surely, 25511111011051 is an apocalyptic number.
5511111011051 is a deficient number, since it is larger than the sum of its proper divisors (1).
5511111011051 is an equidigital number, since it uses as much as digits as its factorization.
5511111011051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 125, while the sum is 23.
The spelling of 5511111011051 in words is "five trillion, five hundred eleven billion, one hundred eleven million, eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •