Base | Representation |
---|---|
bin | 1010010000111111… |
… | …00111110011111001 |
3 | 112020002022210121002 |
4 | 11020133213303321 |
5 | 42241332411002 |
6 | 2310512254345 |
7 | 253400365142 |
oct | 51037476371 |
9 | 15202283532 |
10 | 5511216377 |
11 | 2378a35487 |
12 | 10998413b5 |
13 | 69aa400a4 |
14 | 3a3d36ac9 |
15 | 223c88002 |
hex | 1487e7cf9 |
5511216377 has 2 divisors, whose sum is σ = 5511216378. Its totient is φ = 5511216376.
The previous prime is 5511216371. The next prime is 5511216379. The reversal of 5511216377 is 7736121155.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3725393296 + 1785823081 = 61036^2 + 42259^2 .
It is a cyclic number.
It is not a de Polignac number, because 5511216377 - 26 = 5511216313 is a prime.
It is a super-2 number, since 2×55112163772 = 60747011908226012258, which contains 22 as substring.
Together with 5511216379, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5511216377.
It is not a weakly prime, because it can be changed into another prime (5511216371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2755608188 + 2755608189.
It is an arithmetic number, because the mean of its divisors is an integer number (2755608189).
Almost surely, 25511216377 is an apocalyptic number.
It is an amenable number.
5511216377 is a deficient number, since it is larger than the sum of its proper divisors (1).
5511216377 is an equidigital number, since it uses as much as digits as its factorization.
5511216377 is an evil number, because the sum of its binary digits is even.
The product of its digits is 44100, while the sum is 38.
The square root of 5511216377 is about 74237.5671543727. The cubic root of 5511216377 is about 1766.3732837410.
The spelling of 5511216377 in words is "five billion, five hundred eleven million, two hundred sixteen thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •