Base | Representation |
---|---|
bin | 1010000000111111010110… |
… | …0110001011001110111101 |
3 | 1102222202012200121000102201 |
4 | 2200033311212023032331 |
5 | 2420410311112330203 |
6 | 35230522051351501 |
7 | 2214412432134622 |
oct | 240176546131675 |
9 | 42882180530381 |
10 | 11012121605053 |
11 | 356623a619228 |
12 | 129a2812b2591 |
13 | 61b59182521a |
14 | 2a0dbd3aa349 |
15 | 1416b594ae1d |
hex | a03f598b3bd |
11012121605053 has 2 divisors, whose sum is σ = 11012121605054. Its totient is φ = 11012121605052.
The previous prime is 11012121605039. The next prime is 11012121605077. The reversal of 11012121605053 is 35050612121011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5897816245764 + 5114305359289 = 2428542^2 + 2261483^2 .
It is an emirp because it is prime and its reverse (35050612121011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11012121605053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012121605753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506060802526 + 5506060802527.
It is an arithmetic number, because the mean of its divisors is an integer number (5506060802527).
Almost surely, 211012121605053 is an apocalyptic number.
It is an amenable number.
11012121605053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012121605053 is an equidigital number, since it uses as much as digits as its factorization.
11012121605053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800, while the sum is 28.
Adding to 11012121605053 its reverse (35050612121011), we get a palindrome (46062733726064).
The spelling of 11012121605053 in words is "eleven trillion, twelve billion, one hundred twenty-one million, six hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •