Base | Representation |
---|---|
bin | 11101011011010101101… |
… | …11010100011010111101 |
3 | 10120122212000020010002202 |
4 | 32231222313110122331 |
5 | 113031223202413041 |
6 | 2052255252401245 |
7 | 133023152621444 |
oct | 16555267243275 |
9 | 3518760203082 |
10 | 1011110201021 |
11 | 35a89a392408 |
12 | 143b62916225 |
13 | 74468c98b9b |
14 | 36d1bc01d5b |
15 | 1b47bd22a9b |
hex | eb6add46bd |
1011110201021 has 2 divisors, whose sum is σ = 1011110201022. Its totient is φ = 1011110201020.
The previous prime is 1011110200993. The next prime is 1011110201041. The reversal of 1011110201021 is 1201020111101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 960929272900 + 50180928121 = 980270^2 + 224011^2 .
It is an emirp because it is prime and its reverse (1201020111101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1011110201021 - 210 = 1011110199997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011110200993 and 1011110201011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011110201041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505555100510 + 505555100511.
It is an arithmetic number, because the mean of its divisors is an integer number (505555100511).
Almost surely, 21011110201021 is an apocalyptic number.
It is an amenable number.
1011110201021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011110201021 is an equidigital number, since it uses as much as digits as its factorization.
1011110201021 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 1011110201021 its reverse (1201020111101), we get a palindrome (2212130312122).
The spelling of 1011110201021 in words is "one trillion, eleven billion, one hundred ten million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •