Base | Representation |
---|---|
bin | 1011000110001000111111… |
… | …1001000011110010110101 |
3 | 1121012022122102110102020202 |
4 | 2301202033321003302311 |
5 | 3044341322013022102 |
6 | 41540354110210245 |
7 | 2366300243222264 |
oct | 261421771036265 |
9 | 47168572412222 |
10 | 12200121220277 |
11 | 3984051410651 |
12 | 145056bab3985 |
13 | 6a660ab72223 |
14 | 3026bbc165db |
15 | 162546d3be02 |
hex | b188fe43cb5 |
12200121220277 has 2 divisors, whose sum is σ = 12200121220278. Its totient is φ = 12200121220276.
The previous prime is 12200121220033. The next prime is 12200121220291. The reversal of 12200121220277 is 77202212100221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8488214210116 + 3711907010161 = 2913454^2 + 1926631^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200121220277 - 236 = 12131401743541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12200121220297) 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, 6100060610138 + 6100060610139.
It is an arithmetic number, because the mean of its divisors is an integer number (6100060610139).
Almost surely, 212200121220277 is an apocalyptic number.
It is an amenable number.
12200121220277 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200121220277 is an equidigital number, since it uses as much as digits as its factorization.
12200121220277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3136, while the sum is 29.
Adding to 12200121220277 its reverse (77202212100221), we get a palindrome (89402333320498).
The spelling of 12200121220277 in words is "twelve trillion, two hundred billion, one hundred twenty-one million, two hundred twenty thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •