Base | Representation |
---|---|
bin | 110010000011001010111010… |
… | …111011100111011010110011 |
3 | 1001212101021201220121212122022 |
4 | 302003022322323213122303 |
5 | 212322422142242011011 |
6 | 2100053454543302055 |
7 | 64236106002405002 |
oct | 6203127273473263 |
9 | 1055337656555568 |
10 | 220120210110131 |
11 | 641565030a3341 |
12 | 20830930baa92b |
13 | 95a9329143ca6 |
14 | 3c4dc3707cc39 |
15 | 1a6ac725808db |
hex | c832baee76b3 |
220120210110131 has 2 divisors, whose sum is σ = 220120210110132. Its totient is φ = 220120210110130.
The previous prime is 220120210109983. The next prime is 220120210110133. The reversal of 220120210110131 is 131011012021022.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220120210110131 - 214 = 220120210093747 is a prime.
It is a super-2 number, since 2×2201202101101312 (a number of 29 digits) contains 22 as substring.
Together with 220120210110133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (220120210110133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110060105055065 + 110060105055066.
It is an arithmetic number, because the mean of its divisors is an integer number (110060105055066).
Almost surely, 2220120210110131 is an apocalyptic number.
220120210110131 is a deficient number, since it is larger than the sum of its proper divisors (1).
220120210110131 is an equidigital number, since it uses as much as digits as its factorization.
220120210110131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 220120210110131 its reverse (131011012021022), we get a palindrome (351131222131153).
The spelling of 220120210110131 in words is "two hundred twenty trillion, one hundred twenty billion, two hundred ten million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •