Base | Representation |
---|---|
bin | 10100100001110011… |
… | …10010000101101111 |
3 | 1001110001221212021212 |
4 | 22100321302011233 |
5 | 140032334013241 |
6 | 5021334145035 |
7 | 540052651313 |
oct | 122071620557 |
9 | 31401855255 |
10 | 11021001071 |
11 | 4746082253 |
12 | 2176ab217b |
13 | 106839b612 |
14 | 7679b9b43 |
15 | 44783bbeb |
hex | 290e7216f |
11021001071 has 2 divisors, whose sum is σ = 11021001072. Its totient is φ = 11021001070.
The previous prime is 11021001037. The next prime is 11021001107. The reversal of 11021001071 is 17010012011.
11021001071 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (11021001107) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (17010012011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11021001071 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021031071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510500535 + 5510500536.
It is an arithmetic number, because the mean of its divisors is an integer number (5510500536).
Almost surely, 211021001071 is an apocalyptic number.
11021001071 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021001071 is an equidigital number, since it uses as much as digits as its factorization.
11021001071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 14.
Adding to 11021001071 its reverse (17010012011), we get a palindrome (28031013082).
The spelling of 11021001071 in words is "eleven billion, twenty-one million, one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •