Base | Representation |
---|---|
bin | 1010010010010101100001… |
… | …1010110101011100111001 |
3 | 1111001020102120022220011202 |
4 | 2210211120122311130321 |
5 | 2440301122333220212 |
6 | 40015445243303545 |
7 | 2245062423333464 |
oct | 244453032653471 |
9 | 44036376286152 |
10 | 11310132320057 |
11 | 367066692723a |
12 | 1327b9051abb5 |
13 | 64070548b8cc |
14 | 2b15b02422db |
15 | 1493086620c2 |
hex | a49586b5739 |
11310132320057 has 2 divisors, whose sum is σ = 11310132320058. Its totient is φ = 11310132320056.
The previous prime is 11310132319987. The next prime is 11310132320143. The reversal of 11310132320057 is 75002323101311.
11310132320057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11256669169216 + 53463150841 = 3355096^2 + 231221^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11310132320057 is a prime.
It is not a weakly prime, because it can be changed into another prime (11310132322057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655066160028 + 5655066160029.
It is an arithmetic number, because the mean of its divisors is an integer number (5655066160029).
Almost surely, 211310132320057 is an apocalyptic number.
It is an amenable number.
11310132320057 is a deficient number, since it is larger than the sum of its proper divisors (1).
11310132320057 is an equidigital number, since it uses as much as digits as its factorization.
11310132320057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3780, while the sum is 29.
Adding to 11310132320057 its reverse (75002323101311), we get a palindrome (86312455421368).
The spelling of 11310132320057 in words is "eleven trillion, three hundred ten billion, one hundred thirty-two million, three hundred twenty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •