Base | Representation |
---|---|
bin | 111100010001000… |
… | …101010010001101 |
3 | 2121110120202121112 |
4 | 330101011102031 |
5 | 4032321023203 |
6 | 244155341405 |
7 | 34025205431 |
oct | 7421052215 |
9 | 2543522545 |
10 | 1011111053 |
11 | 479822777 |
12 | 242751865 |
13 | 13162a684 |
14 | 984009c1 |
15 | 5db786d8 |
hex | 3c44548d |
1011111053 has 2 divisors, whose sum is σ = 1011111054. Its totient is φ = 1011111052.
The previous prime is 1011110999. The next prime is 1011111083. The reversal of 1011111053 is 3501111101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 519247369 + 491863684 = 22787^2 + 22178^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011111053 - 210 = 1011110029 is a prime.
It is a super-2 number, since 2×10111110532 = 2044691122997537618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011111083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505555526 + 505555527.
It is an arithmetic number, because the mean of its divisors is an integer number (505555527).
Almost surely, 21011111053 is an apocalyptic number.
It is an amenable number.
1011111053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011111053 is an equidigital number, since it uses as much as digits as its factorization.
1011111053 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 14.
The square root of 1011111053 is about 31797.9724668099. The cubic root of 1011111053 is about 1003.6900511077.
Adding to 1011111053 its reverse (3501111101), we get a palindrome (4512222154).
The spelling of 1011111053 in words is "one billion, eleven million, one hundred eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •