Base | Representation |
---|---|
bin | 11101011011010101101… |
… | …11011001010011001001 |
3 | 10120122212000021010111202 |
4 | 32231222313121103021 |
5 | 113031223204033001 |
6 | 2052255253033545 |
7 | 133023153033626 |
oct | 16555267312311 |
9 | 3518760233452 |
10 | 1011110221001 |
11 | 35a89a3a6421 |
12 | 143b629258b5 |
13 | 74468ca4cca |
14 | 36d1bc0934d |
15 | 1b47bd2896b |
hex | eb6add94c9 |
1011110221001 has 2 divisors, whose sum is σ = 1011110221002. Its totient is φ = 1011110221000.
The previous prime is 1011110220943. The next prime is 1011110221019. The reversal of 1011110221001 is 1001220111101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 989028261001 + 22081960000 = 994499^2 + 148600^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011110221001 - 26 = 1011110220937 is a prime.
It is a super-2 number, since 2×10111102210012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1011110221601) 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, 505555110500 + 505555110501.
It is an arithmetic number, because the mean of its divisors is an integer number (505555110501).
Almost surely, 21011110221001 is an apocalyptic number.
It is an amenable number.
1011110221001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011110221001 is an equidigital number, since it uses as much as digits as its factorization.
1011110221001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1011110221001 its reverse (1001220111101), we get a palindrome (2012330332102).
The spelling of 1011110221001 in words is "one trillion, eleven billion, one hundred ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •