Base | Representation |
---|---|
bin | 10100111001000111… |
… | …00111001111011001 |
3 | 1001221200212001102122 |
4 | 22130203213033121 |
5 | 140432412003212 |
6 | 5053000511025 |
7 | 544645545665 |
oct | 123443471731 |
9 | 31850761378 |
10 | 11216516057 |
11 | 483648158a |
12 | 221047b475 |
13 | 1099a45366 |
14 | 7859518a5 |
15 | 459aac272 |
hex | 29c8e73d9 |
11216516057 has 2 divisors, whose sum is σ = 11216516058. Its totient is φ = 11216516056.
The previous prime is 11216516041. The next prime is 11216516063. The reversal of 11216516057 is 75061561211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10401756121 + 814759936 = 101989^2 + 28544^2 .
It is a cyclic number.
It is not a de Polignac number, because 11216516057 - 24 = 11216516041 is a prime.
It is not a weakly prime, because it can be changed into another prime (11216516257) 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, 5608258028 + 5608258029.
It is an arithmetic number, because the mean of its divisors is an integer number (5608258029).
Almost surely, 211216516057 is an apocalyptic number.
It is an amenable number.
11216516057 is a deficient number, since it is larger than the sum of its proper divisors (1).
11216516057 is an equidigital number, since it uses as much as digits as its factorization.
11216516057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 35.
The spelling of 11216516057 in words is "eleven billion, two hundred sixteen million, five hundred sixteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •