Base | Representation |
---|---|
bin | 110010010011010100110011… |
… | …001111101100010000100011 |
3 | 1002000022102011002102112100221 |
4 | 302103110303033230100203 |
5 | 212444114204012413443 |
6 | 2102303451033423511 |
7 | 64412235550445005 |
oct | 6223246317542043 |
9 | 1060272132375327 |
10 | 221230330201123 |
11 | 6454428aa324a1 |
12 | 2098bb05b6ab97 |
13 | 9659c13765b89 |
14 | 3c8b86860a375 |
15 | 1a89a96711eed |
hex | c935333ec423 |
221230330201123 has 2 divisors, whose sum is σ = 221230330201124. Its totient is φ = 221230330201122.
The previous prime is 221230330201099. The next prime is 221230330201141. The reversal of 221230330201123 is 321102033032122.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221230330201123 is a prime.
It is a super-2 number, since 2×2212303302011232 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (221230330201183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110615165100561 + 110615165100562.
It is an arithmetic number, because the mean of its divisors is an integer number (110615165100562).
Almost surely, 2221230330201123 is an apocalyptic number.
221230330201123 is a deficient number, since it is larger than the sum of its proper divisors (1).
221230330201123 is an equidigital number, since it uses as much as digits as its factorization.
221230330201123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 221230330201123 its reverse (321102033032122), we get a palindrome (542332363233245).
The spelling of 221230330201123 in words is "two hundred twenty-one trillion, two hundred thirty billion, three hundred thirty million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •