Base | Representation |
---|---|
bin | 101101111110011010100100… |
… | …000001000011011111111101 |
3 | 222111221020200211100202102111 |
4 | 231332122210001003133331 |
5 | 203000331100324212424 |
6 | 1554013543054254021 |
7 | 60406361531414326 |
oct | 5576324401033775 |
9 | 874836624322374 |
10 | 202201222100989 |
11 | 59478069556951 |
12 | 1a817b501b7311 |
13 | 88a96550a43a7 |
14 | 37d083c9d944d |
15 | 1859ab7945194 |
hex | b7e6a40437fd |
202201222100989 has 2 divisors, whose sum is σ = 202201222100990. Its totient is φ = 202201222100988.
The previous prime is 202201222100953. The next prime is 202201222101029. The reversal of 202201222100989 is 989001222102202.
It is an a-pointer prime, because the next prime (202201222101029) can be obtained adding 202201222100989 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 202040354528100 + 160867572889 = 14214090^2 + 401083^2 .
It is a cyclic number.
It is not a de Polignac number, because 202201222100989 - 213 = 202201222092797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202201222100909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101100611050494 + 101100611050495.
It is an arithmetic number, because the mean of its divisors is an integer number (101100611050495).
Almost surely, 2202201222100989 is an apocalyptic number.
It is an amenable number.
202201222100989 is a deficient number, since it is larger than the sum of its proper divisors (1).
202201222100989 is an equidigital number, since it uses as much as digits as its factorization.
202201222100989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 40.
The spelling of 202201222100989 in words is "two hundred two trillion, two hundred one billion, two hundred twenty-two million, one hundred thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •