Base | Representation |
---|---|
bin | 110010001111111111001111… |
… | …010011011101010010101111 |
3 | 1001222111111021002012112011111 |
4 | 302033333033103131102233 |
5 | 212431340042132400421 |
6 | 2102010244520332451 |
7 | 64356540205551004 |
oct | 6217771723352257 |
9 | 1058444232175144 |
10 | 221001020200111 |
11 | 64466008466768 |
12 | 2095358a614127 |
13 | 96413caccbb48 |
14 | 3c807139b38ab |
15 | 1a83b2500cee1 |
hex | c8ffcf4dd4af |
221001020200111 has 2 divisors, whose sum is σ = 221001020200112. Its totient is φ = 221001020200110.
The previous prime is 221001020200049. The next prime is 221001020200199. The reversal of 221001020200111 is 111002020100122.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221001020200111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 221001020200091 and 221001020200100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221001020200811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110500510100055 + 110500510100056.
It is an arithmetic number, because the mean of its divisors is an integer number (110500510100056).
Almost surely, 2221001020200111 is an apocalyptic number.
221001020200111 is a deficient number, since it is larger than the sum of its proper divisors (1).
221001020200111 is an equidigital number, since it uses as much as digits as its factorization.
221001020200111 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 221001020200111 its reverse (111002020100122), we get a palindrome (332003040300233).
The spelling of 221001020200111 in words is "two hundred twenty-one trillion, one billion, twenty million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •