Base | Representation |
---|---|
bin | 11101011011010101110… |
… | …10110101000101100101 |
3 | 10120122212001221212102102 |
4 | 32231222322311011211 |
5 | 113031223421340003 |
6 | 2052255324221445 |
7 | 133023163503362 |
oct | 16555272650545 |
9 | 3518761855372 |
10 | 1011111121253 |
11 | 35a89a960832 |
12 | 143b6309a885 |
13 | 7446922b9bc |
14 | 36d1bda1469 |
15 | 1b47be55588 |
hex | eb6aeb5165 |
1011111121253 has 2 divisors, whose sum is σ = 1011111121254. Its totient is φ = 1011111121252.
The previous prime is 1011111121187. The next prime is 1011111121303. The reversal of 1011111121253 is 3521211111101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 867817075489 + 143294045764 = 931567^2 + 378542^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011111121253 - 220 = 1011110072677 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011111421253) 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, 505555560626 + 505555560627.
It is an arithmetic number, because the mean of its divisors is an integer number (505555560627).
Almost surely, 21011111121253 is an apocalyptic number.
It is an amenable number.
1011111121253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011111121253 is an equidigital number, since it uses as much as digits as its factorization.
1011111121253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 20.
Adding to 1011111121253 its reverse (3521211111101), we get a palindrome (4532322232354).
The spelling of 1011111121253 in words is "one trillion, eleven billion, one hundred eleven million, one hundred twenty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •