Base | Representation |
---|---|
bin | 110010010110000111010011… |
… | …111011001001000000100001 |
3 | 1002000222201220012110010011001 |
4 | 302112013103323021000201 |
5 | 213010234231123203112 |
6 | 2102531510431152001 |
7 | 64432132454245213 |
oct | 6226072373110041 |
9 | 1060881805403131 |
10 | 221422004506657 |
11 | 646085aa0a2169 |
12 | 20a01099375601 |
13 | 967200bc18b06 |
14 | 3c96c4ca825b3 |
15 | 1a8ea63ca3c57 |
hex | c961d3ec9021 |
221422004506657 has 4 divisors (see below), whose sum is σ = 222340768011076. Its totient is φ = 220503241002240.
The previous prime is 221422004506643. The next prime is 221422004506673. The reversal of 221422004506657 is 756605400224122.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 129072230112016 + 92349774394641 = 11360996^2 + 9609879^2 .
It is a cyclic number.
It is not a de Polignac number, because 221422004506657 - 227 = 221421870288929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221422004506627) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 459381751848 + ... + 459381752329.
It is an arithmetic number, because the mean of its divisors is an integer number (55585192002769).
Almost surely, 2221422004506657 is an apocalyptic number.
It is an amenable number.
221422004506657 is a deficient number, since it is larger than the sum of its proper divisors (918763504419).
221422004506657 is an equidigital number, since it uses as much as digits as its factorization.
221422004506657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918763504418.
The product of its (nonzero) digits is 1612800, while the sum is 46.
The spelling of 221422004506657 in words is "two hundred twenty-one trillion, four hundred twenty-two billion, four million, five hundred six thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •