Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …1101110010111110000001 |
3 | 1102222122100100212221102221 |
4 | 2200032303131302332001 |
5 | 2420401023100043012 |
6 | 35230220015211041 |
7 | 2214343100454013 |
oct | 240166335627601 |
9 | 42878310787387 |
10 | 11011012112257 |
11 | 356582030a933 |
12 | 129a011816a81 |
13 | 61b4459cc801 |
14 | 2a0d15cba1b3 |
15 | 14164d33c507 |
hex | a03b3772f81 |
11011012112257 has 2 divisors, whose sum is σ = 11011012112258. Its totient is φ = 11011012112256.
The previous prime is 11011012112183. The next prime is 11011012112267. The reversal of 11011012112257 is 75221121011011.
11011012112257 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5569784081521 + 5441228030736 = 2360039^2 + 2332644^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011012112257 is a prime.
It is not a weakly prime, because it can be changed into another prime (11011012112267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505506056128 + 5505506056129.
It is an arithmetic number, because the mean of its divisors is an integer number (5505506056129).
Almost surely, 211011012112257 is an apocalyptic number.
It is an amenable number.
11011012112257 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011012112257 is an equidigital number, since it uses as much as digits as its factorization.
11011012112257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 280, while the sum is 25.
Adding to 11011012112257 its reverse (75221121011011), we get a palindrome (86232133123268).
The spelling of 11011012112257 in words is "eleven trillion, eleven billion, twelve million, one hundred twelve thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •