Base | Representation |
---|---|
bin | 1011000110001001010111… |
… | …0110000110111000001101 |
3 | 1121012022220101102022212201 |
4 | 2301202111312012320031 |
5 | 3044342023101003043 |
6 | 41540412035201501 |
7 | 2366302565244304 |
oct | 261422566067015 |
9 | 47168811368781 |
10 | 12200221109773 |
11 | 39840a2837054 |
12 | 1450599446291 |
13 | 6a6625777638 |
14 | 3026cb1b943b |
15 | 1625509bdc4d |
hex | b1895d86e0d |
12200221109773 has 2 divisors, whose sum is σ = 12200221109774. Its totient is φ = 12200221109772.
The previous prime is 12200221109767. The next prime is 12200221109833. The reversal of 12200221109773 is 37790112200221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9365638070889 + 2834583038884 = 3060333^2 + 1683622^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200221109773 - 213 = 12200221101581 is a prime.
It is a super-2 number, since 2×122002211097732 (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 (12200221101773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100110554886 + 6100110554887.
It is an arithmetic number, because the mean of its divisors is an integer number (6100110554887).
Almost surely, 212200221109773 is an apocalyptic number.
It is an amenable number.
12200221109773 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200221109773 is an equidigital number, since it uses as much as digits as its factorization.
12200221109773 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21168, while the sum is 37.
Adding to 12200221109773 its reverse (37790112200221), we get a palindrome (49990333309994).
The spelling of 12200221109773 in words is "twelve trillion, two hundred billion, two hundred twenty-one million, one hundred nine thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •