Base | Representation |
---|---|
bin | 11101011011100001110… |
… | …00010010110110111101 |
3 | 10120200010001010022222222 |
4 | 32231300320102312331 |
5 | 113031430021320221 |
6 | 2052313255415125 |
7 | 133025516462162 |
oct | 16556070226675 |
9 | 3520101108888 |
10 | 1011211120061 |
11 | 35a94135137a |
12 | 143b906844a5 |
13 | 74483b71aac |
14 | 36d2b392069 |
15 | 1b485b099ab |
hex | eb70e12dbd |
1011211120061 has 2 divisors, whose sum is σ = 1011211120062. Its totient is φ = 1011211120060.
The previous prime is 1011211119959. The next prime is 1011211120109. The reversal of 1011211120061 is 1600211121101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 643725405625 + 367485714436 = 802325^2 + 606206^2 .
It is an emirp because it is prime and its reverse (1600211121101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1011211120061 - 238 = 736333213117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011211120261) 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, 505605560030 + 505605560031.
It is an arithmetic number, because the mean of its divisors is an integer number (505605560031).
Almost surely, 21011211120061 is an apocalyptic number.
It is an amenable number.
1011211120061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011211120061 is an equidigital number, since it uses as much as digits as its factorization.
1011211120061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 1011211120061 its reverse (1600211121101), we get a palindrome (2611422241162).
The spelling of 1011211120061 in words is "one trillion, eleven billion, two hundred eleven million, one hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.099 sec. • engine limits •