Base | Representation |
---|---|
bin | 10000000010100000111… |
… | …001010111010110101001 |
3 | 10220100222222111020020211 |
4 | 100002200321113112221 |
5 | 121024312010121301 |
6 | 2202203155221121 |
7 | 142426550042404 |
oct | 20024071272651 |
9 | 3810888436224 |
10 | 1102211020201 |
11 | 395499428215 |
12 | 1597482a77a1 |
13 | 7cc26b97955 |
14 | 3b4c0db2d3b |
15 | 1da0eb48051 |
hex | 100a0e575a9 |
1102211020201 has 2 divisors, whose sum is σ = 1102211020202. Its totient is φ = 1102211020200.
The previous prime is 1102211020199. The next prime is 1102211020219. The reversal of 1102211020201 is 1020201122011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1078795899801 + 23415120400 = 1038651^2 + 153020^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102211020201 - 21 = 1102211020199 is a prime.
Together with 1102211020199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1102211023201) 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, 551105510100 + 551105510101.
It is an arithmetic number, because the mean of its divisors is an integer number (551105510101).
Almost surely, 21102211020201 is an apocalyptic number.
It is an amenable number.
1102211020201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102211020201 is an equidigital number, since it uses as much as digits as its factorization.
1102211020201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1102211020201 its reverse (1020201122011), we get a palindrome (2122412142212).
The spelling of 1102211020201 in words is "one trillion, one hundred two billion, two hundred eleven million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •