Base | Representation |
---|---|
bin | 101101101110101011110010… |
… | …110110101011000111001011 |
3 | 222101002220102110001200121102 |
4 | 231232223302312223013023 |
5 | 202330123144013134011 |
6 | 1551425203402132015 |
7 | 60235312240015025 |
oct | 5556536266530713 |
9 | 871086373050542 |
10 | 201120213021131 |
11 | 590a067006a288 |
12 | 1a6825404b100b |
13 | 882b729907a91 |
14 | 37943ad7c5015 |
15 | 183b8e933873b |
hex | b6eaf2dab1cb |
201120213021131 has 2 divisors, whose sum is σ = 201120213021132. Its totient is φ = 201120213021130.
The previous prime is 201120213021083. The next prime is 201120213021163. The reversal of 201120213021131 is 131120312021102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201120213021131 - 226 = 201120145912267 is a prime.
It is a super-2 number, since 2×2011202130211312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201120213021181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100560106510565 + 100560106510566.
It is an arithmetic number, because the mean of its divisors is an integer number (100560106510566).
Almost surely, 2201120213021131 is an apocalyptic number.
201120213021131 is a deficient number, since it is larger than the sum of its proper divisors (1).
201120213021131 is an equidigital number, since it uses as much as digits as its factorization.
201120213021131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 201120213021131 its reverse (131120312021102), we get a palindrome (332240525042233).
The spelling of 201120213021131 in words is "two hundred one trillion, one hundred twenty billion, two hundred thirteen million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •