Base | Representation |
---|---|
bin | 1010000011010000010111… |
… | …11000010100111001100001 |
3 | 2220020221101102101120211121 |
4 | 11001220023320110321201 |
5 | 10344110100330122012 |
6 | 115001322014212241 |
7 | 4440552444621646 |
oct | 501501370247141 |
9 | 86227342346747 |
10 | 22102101020257 |
11 | 70514a29095a5 |
12 | 258b650ab4081 |
13 | c442b0711b9b |
14 | 565a66c01dcd |
15 | 284dd6767a07 |
hex | 141a0be14e61 |
22102101020257 has 2 divisors, whose sum is σ = 22102101020258. Its totient is φ = 22102101020256.
The previous prime is 22102101020203. The next prime is 22102101020261. The reversal of 22102101020257 is 75202010120122.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20788347211776 + 1313753808481 = 4559424^2 + 1146191^2 .
It is a cyclic number.
It is not a de Polignac number, because 22102101020257 - 215 = 22102100987489 is a prime.
It is not a weakly prime, because it can be changed into another prime (22102101024257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11051050510128 + 11051050510129.
It is an arithmetic number, because the mean of its divisors is an integer number (11051050510129).
Almost surely, 222102101020257 is an apocalyptic number.
It is an amenable number.
22102101020257 is a deficient number, since it is larger than the sum of its proper divisors (1).
22102101020257 is an equidigital number, since it uses as much as digits as its factorization.
22102101020257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 25.
Adding to 22102101020257 its reverse (75202010120122), we get a palindrome (97304111140379).
The spelling of 22102101020257 in words is "twenty-two trillion, one hundred two billion, one hundred one million, twenty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •