Base | Representation |
---|---|
bin | 101101101101000110001011… |
… | …001101100001111110000011 |
3 | 222100201110210011122220200102 |
4 | 231231012023031201332003 |
5 | 202321331213100001011 |
6 | 1551303120255313015 |
7 | 60224400305442131 |
oct | 5555061315417603 |
9 | 870643704586612 |
10 | 201011100000131 |
11 | 59059368668673 |
12 | 1a66536a81b76b |
13 | 882135b0c5925 |
14 | 378cdbc32c751 |
15 | 1838b6004973b |
hex | b6d18b361f83 |
201011100000131 has 2 divisors, whose sum is σ = 201011100000132. Its totient is φ = 201011100000130.
The previous prime is 201011100000083. The next prime is 201011100000149. The reversal of 201011100000131 is 131000001110102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201011100000131 - 210 = 201011099999107 is a prime.
It is a super-2 number, since 2×2010111000001312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201011100000331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505550000065 + 100505550000066.
It is an arithmetic number, because the mean of its divisors is an integer number (100505550000066).
Almost surely, 2201011100000131 is an apocalyptic number.
201011100000131 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011100000131 is an equidigital number, since it uses as much as digits as its factorization.
201011100000131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 201011100000131 its reverse (131000001110102), we get a palindrome (332011101110233).
The spelling of 201011100000131 in words is "two hundred one trillion, eleven billion, one hundred million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •