Base | Representation |
---|---|
bin | 11101011011010111001… |
… | …01001000100011000101 |
3 | 10120122212211211021201021 |
4 | 32231223211020203011 |
5 | 113031234241223023 |
6 | 2052300402031141 |
7 | 133023356662135 |
oct | 16555345104305 |
9 | 3518784737637 |
10 | 1011122211013 |
11 | 35a8a6145722 |
12 | 143b669484b1 |
13 | 7446b6125a5 |
14 | 36d1d64aac5 |
15 | 1b47cde635d |
hex | eb6b9488c5 |
1011122211013 has 2 divisors, whose sum is σ = 1011122211014. Its totient is φ = 1011122211012.
The previous prime is 1011122210953. The next prime is 1011122211119. The reversal of 1011122211013 is 3101122211101.
It is a happy number.
1011122211013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 512280884644 + 498841326369 = 715738^2 + 706287^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011122211013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011122214013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505561105506 + 505561105507.
It is an arithmetic number, because the mean of its divisors is an integer number (505561105507).
Almost surely, 21011122211013 is an apocalyptic number.
It is an amenable number.
1011122211013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011122211013 is an equidigital number, since it uses as much as digits as its factorization.
1011122211013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 1011122211013 its reverse (3101122211101), we get a palindrome (4112244422114).
The spelling of 1011122211013 in words is "one trillion, eleven billion, one hundred twenty-two million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •