Base | Representation |
---|---|
bin | 1011000110001001010010… |
… | …1001110111000110000001 |
3 | 1121012022211222210212001101 |
4 | 2301202110221313012001 |
5 | 3044342002441402202 |
6 | 41540410042534401 |
7 | 2366302233326365 |
oct | 261422451670601 |
9 | 47168758725041 |
10 | 12200201122177 |
11 | 3984092525082 |
12 | 1450592807401 |
13 | 6a6621599a63 |
14 | 3026c86952a5 |
15 | 16254dd71887 |
hex | b1894a77181 |
12200201122177 has 2 divisors, whose sum is σ = 12200201122178. Its totient is φ = 12200201122176.
The previous prime is 12200201122141. The next prime is 12200201122259. The reversal of 12200201122177 is 77122110200221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11159401243761 + 1040799878416 = 3340569^2 + 1020196^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200201122177 - 223 = 12200192733569 is a prime.
It is not a weakly prime, because it can be changed into another prime (12200201123177) 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, 6100100561088 + 6100100561089.
It is an arithmetic number, because the mean of its divisors is an integer number (6100100561089).
Almost surely, 212200201122177 is an apocalyptic number.
It is an amenable number.
12200201122177 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200201122177 is an equidigital number, since it uses as much as digits as its factorization.
12200201122177 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1568, while the sum is 28.
Adding to 12200201122177 its reverse (77122110200221), we get a palindrome (89322311322398).
The spelling of 12200201122177 in words is "twelve trillion, two hundred billion, two hundred one million, one hundred twenty-two thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •