Base | Representation |
---|---|
bin | 101101101110011001111010… |
… | …111111000111111010001011 |
3 | 222101001001212222221221110121 |
4 | 231232121322333013322023 |
5 | 202324314343124214011 |
6 | 1551412311214124111 |
7 | 60234032540622655 |
oct | 5556317277077213 |
9 | 871031788857417 |
10 | 201101022101131 |
11 | 59093512313019 |
12 | 1a67a8854b0637 |
13 | 882998ba41c09 |
14 | 37934acb4d6d5 |
15 | 183b174639e71 |
hex | b6e67afc7e8b |
201101022101131 has 2 divisors, whose sum is σ = 201101022101132. Its totient is φ = 201101022101130.
The previous prime is 201101022101053. The next prime is 201101022101159. The reversal of 201101022101131 is 131101220101102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201101022101131 - 215 = 201101022068363 is a prime.
It is a super-2 number, since 2×2011010221011312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201101022104131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550511050565 + 100550511050566.
It is an arithmetic number, because the mean of its divisors is an integer number (100550511050566).
Almost surely, 2201101022101131 is an apocalyptic number.
201101022101131 is a deficient number, since it is larger than the sum of its proper divisors (1).
201101022101131 is an equidigital number, since it uses as much as digits as its factorization.
201101022101131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 201101022101131 its reverse (131101220101102), we get a palindrome (332202242202233).
The spelling of 201101022101131 in words is "two hundred one trillion, one hundred one billion, twenty-two million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •