Base | Representation |
---|---|
bin | 10000000011010110101… |
… | …010111010111000001011 |
3 | 10220110022212002212200101 |
4 | 100003112222322320023 |
5 | 121033133440000321 |
6 | 2202432504150231 |
7 | 142461113342515 |
oct | 20032652727013 |
9 | 3813285085611 |
10 | 1103113203211 |
11 | 395911710708 |
12 | 15995a468377 |
13 | 8003ba76b56 |
14 | 3b568b3abb5 |
15 | 1da63e56791 |
hex | 100d6abae0b |
1103113203211 has 2 divisors, whose sum is σ = 1103113203212. Its totient is φ = 1103113203210.
The previous prime is 1103113203163. The next prime is 1103113203221. The reversal of 1103113203211 is 1123023113011.
It is a strong prime.
It is an emirp because it is prime and its reverse (1123023113011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1103113203211 is a prime.
It is not a weakly prime, because it can be changed into another prime (1103113203221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551556601605 + 551556601606.
It is an arithmetic number, because the mean of its divisors is an integer number (551556601606).
Almost surely, 21103113203211 is an apocalyptic number.
1103113203211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103113203211 is an equidigital number, since it uses as much as digits as its factorization.
1103113203211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1103113203211 its reverse (1123023113011), we get a palindrome (2226136316222).
The spelling of 1103113203211 in words is "one trillion, one hundred three billion, one hundred thirteen million, two hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •