Base | Representation |
---|---|
bin | 1010000110001000100110… |
… | …11011110011110011010101 |
3 | 2220121101200200212111010101 |
4 | 11003010103123303303111 |
5 | 10402220133033311242 |
6 | 115115000520054101 |
7 | 4450653526306006 |
oct | 503042333636325 |
9 | 86541620774111 |
10 | 22201012010197 |
11 | 708a43a556289 |
12 | 25a6856004331 |
13 | c5071471ac77 |
14 | 56a76b3851ad |
15 | 28777508c9b7 |
hex | 1431136f3cd5 |
22201012010197 has 2 divisors, whose sum is σ = 22201012010198. Its totient is φ = 22201012010196.
The previous prime is 22201012010183. The next prime is 22201012010237. The reversal of 22201012010197 is 79101021010222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21417726829041 + 783285181156 = 4627929^2 + 885034^2 .
It is a cyclic number.
It is not a de Polignac number, because 22201012010197 - 227 = 22200877792469 is a prime.
It is a super-2 number, since 2×222010120101972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22201012010117) 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, 11100506005098 + 11100506005099.
It is an arithmetic number, because the mean of its divisors is an integer number (11100506005099).
Almost surely, 222201012010197 is an apocalyptic number.
It is an amenable number.
22201012010197 is a deficient number, since it is larger than the sum of its proper divisors (1).
22201012010197 is an equidigital number, since it uses as much as digits as its factorization.
22201012010197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 28.
The spelling of 22201012010197 in words is "twenty-two trillion, two hundred one billion, twelve million, ten thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •