Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …01011011111001011001011 |
3 | 2121220002210121121020021122 |
4 | 10203113020023133023023 |
5 | 10111020431430134011 |
6 | 110330023331025455 |
7 | 4134361543420001 |
oct | 443271013371313 |
9 | 77802717536248 |
10 | 20022201021131 |
11 | 641a405553891 |
12 | 22b452a73b28b |
13 | b23115989a2a |
14 | 4d31189a8a71 |
15 | 24ac53e713db |
hex | 1235c82df2cb |
20022201021131 has 2 divisors, whose sum is σ = 20022201021132. Its totient is φ = 20022201021130.
The previous prime is 20022201021061. The next prime is 20022201021253. The reversal of 20022201021131 is 13112010222002.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20022201021131 is a prime.
It is a super-2 number, since 2×200222010211312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20022201020131) 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, 10011100510565 + 10011100510566.
It is an arithmetic number, because the mean of its divisors is an integer number (10011100510566).
Almost surely, 220022201021131 is an apocalyptic number.
20022201021131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022201021131 is an equidigital number, since it uses as much as digits as its factorization.
20022201021131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 20022201021131 its reverse (13112010222002), we get a palindrome (33134211243133).
The spelling of 20022201021131 in words is "twenty trillion, twenty-two billion, two hundred one million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •