Base | Representation |
---|---|
bin | 10100100001110101… |
… | …11110010000010111 |
3 | 1001110002112201020112 |
4 | 22100322332100113 |
5 | 140032424004142 |
6 | 5021344553235 |
7 | 540055421003 |
oct | 122072762027 |
9 | 31402481215 |
10 | 11021313047 |
11 | 4746275688 |
12 | 217702281b |
13 | 106847a614 |
14 | 767a5b703 |
15 | 44789e382 |
hex | 290ebe417 |
11021313047 has 2 divisors, whose sum is σ = 11021313048. Its totient is φ = 11021313046.
The previous prime is 11021313001. The next prime is 11021313049. The reversal of 11021313047 is 74031312011.
It is a happy number.
11021313047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (74031312011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11021313047 - 210 = 11021312023 is a prime.
Together with 11021313049, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021313049) 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, 5510656523 + 5510656524.
It is an arithmetic number, because the mean of its divisors is an integer number (5510656524).
Almost surely, 211021313047 is an apocalyptic number.
11021313047 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021313047 is an equidigital number, since it uses as much as digits as its factorization.
11021313047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 11021313047 its reverse (74031312011), we get a palindrome (85052625058).
The spelling of 11021313047 in words is "eleven billion, twenty-one million, three hundred thirteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •