Base | Representation |
---|---|
bin | 1010000110001000111101… |
… | …01000111110001110000101 |
3 | 2220121102011210121212112101 |
4 | 11003010132220332032011 |
5 | 10402221024200310432 |
6 | 115115031313352101 |
7 | 4450661301263512 |
oct | 503043650761605 |
9 | 86542153555471 |
10 | 22201200010117 |
11 | 708a526692417 |
12 | 25a68a8b68631 |
13 | c5074466321b |
14 | 56a788322309 |
15 | 2877868264e7 |
hex | 14311ea3e385 |
22201200010117 has 2 divisors, whose sum is σ = 22201200010118. Its totient is φ = 22201200010116.
The previous prime is 22201200010109. The next prime is 22201200010151. The reversal of 22201200010117 is 71101000210222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22194189967041 + 7010043076 = 4711071^2 + 83726^2 .
It is a cyclic number.
It is not a de Polignac number, because 22201200010117 - 23 = 22201200010109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22201200010094 and 22201200010103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22201200010217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11100600005058 + 11100600005059.
It is an arithmetic number, because the mean of its divisors is an integer number (11100600005059).
Almost surely, 222201200010117 is an apocalyptic number.
It is an amenable number.
22201200010117 is a deficient number, since it is larger than the sum of its proper divisors (1).
22201200010117 is an equidigital number, since it uses as much as digits as its factorization.
22201200010117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 22201200010117 its reverse (71101000210222), we get a palindrome (93302200220339).
The spelling of 22201200010117 in words is "twenty-two trillion, two hundred one billion, two hundred million, ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •