Base | Representation |
---|---|
bin | 110010010001111010001001… |
… | …111111100001011000000011 |
3 | 1001222222002221001222201010212 |
4 | 302101322021333201120003 |
5 | 212441020341320112402 |
6 | 2102151033130144335 |
7 | 64402221626634515 |
oct | 6221721177413003 |
9 | 1058862831881125 |
10 | 221133001332227 |
11 | 64506a85365766 |
12 | 209750828820ab |
13 | 96509a24729aa |
14 | 3c86c74225bb5 |
15 | 1a8729bc58952 |
hex | c91e89fe1603 |
221133001332227 has 2 divisors, whose sum is σ = 221133001332228. Its totient is φ = 221133001332226.
The previous prime is 221133001332197. The next prime is 221133001332511. The reversal of 221133001332227 is 722233100331122.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 221133001332227 - 230 = 221131927590403 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 221133001332193 and 221133001332202.
It is not a weakly prime, because it can be changed into another prime (221133001332827) 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, 110566500666113 + 110566500666114.
It is an arithmetic number, because the mean of its divisors is an integer number (110566500666114).
Almost surely, 2221133001332227 is an apocalyptic number.
221133001332227 is a deficient number, since it is larger than the sum of its proper divisors (1).
221133001332227 is an equidigital number, since it uses as much as digits as its factorization.
221133001332227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 32.
Adding to 221133001332227 its reverse (722233100331122), we get a palindrome (943366101663349).
The spelling of 221133001332227 in words is "two hundred twenty-one trillion, one hundred thirty-three billion, one million, three hundred thirty-two thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •