Base | Representation |
---|---|
bin | 10100111000011101… |
… | …00101000100000001 |
3 | 1001221022110220201111 |
4 | 22130032211010001 |
5 | 140430004031423 |
6 | 5052242403321 |
7 | 544550642233 |
oct | 123416450401 |
9 | 31838426644 |
10 | 11211002113 |
11 | 4833355903 |
12 | 220a660541 |
13 | 109886467c |
14 | 784d18253 |
15 | 45936d60d |
hex | 29c3a5101 |
11211002113 has 2 divisors, whose sum is σ = 11211002114. Its totient is φ = 11211002112.
The previous prime is 11211002093. The next prime is 11211002123. The reversal of 11211002113 is 31120011211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11036973249 + 174028864 = 105057^2 + 13192^2 .
It is an emirp because it is prime and its reverse (31120011211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11211002113 - 25 = 11211002081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11211002093 and 11211002102.
It is not a weakly prime, because it can be changed into another prime (11211002123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605501056 + 5605501057.
It is an arithmetic number, because the mean of its divisors is an integer number (5605501057).
Almost surely, 211211002113 is an apocalyptic number.
It is an amenable number.
11211002113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11211002113 is an equidigital number, since it uses as much as digits as its factorization.
11211002113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11211002113 its reverse (31120011211), we get a palindrome (42331013324).
The spelling of 11211002113 in words is "eleven billion, two hundred eleven million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •