Base | Representation |
---|---|
bin | 1100110111010111100… |
… | …0010010001110111001 |
3 | 210010111100001012101221 |
4 | 3031311320102032321 |
5 | 12110122340133423 |
6 | 245311411312041 |
7 | 21653051452564 |
oct | 3156570221671 |
9 | 703440035357 |
10 | 221021021113 |
11 | 85809671522 |
12 | 36a035ab621 |
13 | 17ac43b40c9 |
14 | a9a9c274db |
15 | 5b38b74e5d |
hex | 3375e123b9 |
221021021113 has 2 divisors, whose sum is σ = 221021021114. Its totient is φ = 221021021112.
The previous prime is 221021021083. The next prime is 221021021119. The reversal of 221021021113 is 311120120122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 170892945664 + 50128075449 = 413392^2 + 223893^2 .
It is a cyclic number.
It is not a de Polignac number, because 221021021113 - 233 = 212431086521 is a prime.
It is not a weakly prime, because it can be changed into another prime (221021021119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110510510556 + 110510510557.
It is an arithmetic number, because the mean of its divisors is an integer number (110510510557).
Almost surely, 2221021021113 is an apocalyptic number.
It is an amenable number.
221021021113 is a deficient number, since it is larger than the sum of its proper divisors (1).
221021021113 is an equidigital number, since it uses as much as digits as its factorization.
221021021113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 221021021113 its reverse (311120120122), we get a palindrome (532141141235).
Subtracting 221021021113 from its reverse (311120120122), we obtain a palindrome (90099099009).
The spelling of 221021021113 in words is "two hundred twenty-one billion, twenty-one million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •