Base | Representation |
---|---|
bin | 110010010000011010011010… |
… | …101111000101011011100011 |
3 | 1001222121021120212211102120121 |
4 | 302100122122233011123203 |
5 | 212432324323433133102 |
6 | 2102031512401421111 |
7 | 64361622323463361 |
oct | 6220323257053343 |
9 | 1058537525742517 |
10 | 221030203021027 |
11 | 644774233a5a84 |
12 | 2095917393a797 |
13 | 964409bca790a |
14 | 3c81cc16a0631 |
15 | 1a84782019b37 |
hex | c9069abc56e3 |
221030203021027 has 2 divisors, whose sum is σ = 221030203021028. Its totient is φ = 221030203021026.
The previous prime is 221030203021013. The next prime is 221030203021039. The reversal of 221030203021027 is 720120302030122.
221030203021027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 221030203021027 - 223 = 221030194632419 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 221030203020992 and 221030203021010.
It is not a weakly prime, because it can be changed into another prime (221030203321027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110515101510513 + 110515101510514.
It is an arithmetic number, because the mean of its divisors is an integer number (110515101510514).
Almost surely, 2221030203021027 is an apocalyptic number.
221030203021027 is a deficient number, since it is larger than the sum of its proper divisors (1).
221030203021027 is an equidigital number, since it uses as much as digits as its factorization.
221030203021027 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 25.
Adding to 221030203021027 its reverse (720120302030122), we get a palindrome (941150505051149).
The spelling of 221030203021027 in words is "two hundred twenty-one trillion, thirty billion, two hundred three million, twenty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •