Base | Representation |
---|---|
bin | 100101001100001110111… |
… | …0001110000110100111101 |
3 | 200002122200222002220201111 |
4 | 1022120131301300310331 |
5 | 1132221333212312212 |
6 | 14512110125042021 |
7 | 1035202666534231 |
oct | 112303561606475 |
9 | 20078628086644 |
10 | 5111510666557 |
11 | 16a0863572829 |
12 | 6a678a6b6311 |
13 | 2b10235494b9 |
14 | 1395814485c1 |
15 | 8ce6726dea7 |
hex | 4a61dc70d3d |
5111510666557 has 2 divisors, whose sum is σ = 5111510666558. Its totient is φ = 5111510666556.
The previous prime is 5111510666533. The next prime is 5111510666609. The reversal of 5111510666557 is 7556660151115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4695048241636 + 416462424921 = 2166806^2 + 645339^2 .
It is a cyclic number.
It is not a de Polignac number, because 5111510666557 - 211 = 5111510664509 is a prime.
It is a super-2 number, since 2×51115106665572 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5111510666557.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5111510663557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555755333278 + 2555755333279.
It is an arithmetic number, because the mean of its divisors is an integer number (2555755333279).
Almost surely, 25111510666557 is an apocalyptic number.
It is an amenable number.
5111510666557 is a deficient number, since it is larger than the sum of its proper divisors (1).
5111510666557 is an equidigital number, since it uses as much as digits as its factorization.
5111510666557 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 945000, while the sum is 49.
The spelling of 5111510666557 in words is "five trillion, one hundred eleven billion, five hundred ten million, six hundred sixty-six thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •