Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0111000001101111011101 |
3 | 1102222122121020222000100221 |
4 | 2200032321113001233131 |
5 | 2420401223404013203 |
6 | 35230233510521341 |
7 | 2214345411140362 |
oct | 240167127015735 |
9 | 42878536860327 |
10 | 11011111001053 |
11 | 3565871112509 |
12 | 129a03a966251 |
13 | 61b4603445a7 |
14 | 2a0d2509c469 |
15 | 141656d72abd |
hex | a03b95c1bdd |
11011111001053 has 2 divisors, whose sum is σ = 11011111001054. Its totient is φ = 11011111001052.
The previous prime is 11011111000987. The next prime is 11011111001063. The reversal of 11011111001053 is 35010011111011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10656320417604 + 354790583449 = 3264402^2 + 595643^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011111001053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011111001063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505555500526 + 5505555500527.
It is an arithmetic number, because the mean of its divisors is an integer number (5505555500527).
Almost surely, 211011111001053 is an apocalyptic number.
It is an amenable number.
11011111001053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011111001053 is an equidigital number, since it uses as much as digits as its factorization.
11011111001053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15, while the sum is 16.
Adding to 11011111001053 its reverse (35010011111011), we get a palindrome (46021122112064).
The spelling of 11011111001053 in words is "eleven trillion, eleven billion, one hundred eleven million, one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •