Base | Representation |
---|---|
bin | 10100100101111111… |
… | …10000101101011001 |
3 | 1001112112001020010102 |
4 | 22102333300231121 |
5 | 140120331411323 |
6 | 5025031025145 |
7 | 540660330626 |
oct | 122277605531 |
9 | 31475036112 |
10 | 11056122713 |
11 | 47639906a9 |
12 | 218680b1b5 |
13 | 107274785c |
14 | 76c51d34d |
15 | 44a978328 |
hex | 292ff0b59 |
11056122713 has 2 divisors, whose sum is σ = 11056122714. Its totient is φ = 11056122712.
The previous prime is 11056122697. The next prime is 11056122757. The reversal of 11056122713 is 31722165011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7532156944 + 3523965769 = 86788^2 + 59363^2 .
It is a cyclic number.
It is not a de Polignac number, because 11056122713 - 24 = 11056122697 is a prime.
It is not a weakly prime, because it can be changed into another prime (11056124713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5528061356 + 5528061357.
It is an arithmetic number, because the mean of its divisors is an integer number (5528061357).
Almost surely, 211056122713 is an apocalyptic number.
It is an amenable number.
11056122713 is a deficient number, since it is larger than the sum of its proper divisors (1).
11056122713 is an equidigital number, since it uses as much as digits as its factorization.
11056122713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 29.
Adding to 11056122713 its reverse (31722165011), we get a palindrome (42778287724).
The spelling of 11056122713 in words is "eleven billion, fifty-six million, one hundred twenty-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •