Base | Representation |
---|---|
bin | 110010000011001010111010… |
… | …011001001111111101111101 |
3 | 1001212101021201021200011200111 |
4 | 302003022322121033331331 |
5 | 212322422132440214211 |
6 | 2100053454022230021 |
7 | 64236105533003563 |
oct | 6203127231177575 |
9 | 1055337637604614 |
10 | 220120201101181 |
11 | 641564a8aaa827 |
12 | 20830929b85311 |
13 | 95a932730b554 |
14 | 3c4dc35bb5a33 |
15 | 1a6ac718a1421 |
hex | c832ba64ff7d |
220120201101181 has 2 divisors, whose sum is σ = 220120201101182. Its totient is φ = 220120201101180.
The previous prime is 220120201101127. The next prime is 220120201101247. The reversal of 220120201101181 is 181101102021022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 216997470335556 + 3122730765625 = 14730834^2 + 1767125^2 .
It is a cyclic number.
It is not a de Polignac number, because 220120201101181 - 231 = 220118053617533 is a prime.
It is a super-2 number, since 2×2201202011011812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220120201101881) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110060100550590 + 110060100550591.
It is an arithmetic number, because the mean of its divisors is an integer number (110060100550591).
Almost surely, 2220120201101181 is an apocalyptic number.
It is an amenable number.
220120201101181 is a deficient number, since it is larger than the sum of its proper divisors (1).
220120201101181 is an equidigital number, since it uses as much as digits as its factorization.
220120201101181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 22.
The spelling of 220120201101181 in words is "two hundred twenty trillion, one hundred twenty billion, two hundred one million, one hundred one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •