Base | Representation |
---|---|
bin | 1011101101010001001… |
… | …0000100001011001101 |
3 | 201020011002120200121001 |
4 | 2323110102010023031 |
5 | 11243403240013401 |
6 | 232221533540301 |
7 | 20350121541601 |
oct | 2732422041315 |
9 | 636132520531 |
10 | 201130001101 |
11 | 78331707807 |
12 | 32b92044691 |
13 | 15c74475493 |
14 | 9a401cd501 |
15 | 5372784601 |
hex | 2ed44842cd |
201130001101 has 2 divisors, whose sum is σ = 201130001102. Its totient is φ = 201130001100.
The previous prime is 201130001087. The next prime is 201130001131. The reversal of 201130001101 is 101100031102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 164591678601 + 36538322500 = 405699^2 + 191150^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201130001101 is a prime.
It is a super-2 number, since 2×2011300011012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201130001131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100565000550 + 100565000551.
It is an arithmetic number, because the mean of its divisors is an integer number (100565000551).
Almost surely, 2201130001101 is an apocalyptic number.
It is an amenable number.
201130001101 is a deficient number, since it is larger than the sum of its proper divisors (1).
201130001101 is an equidigital number, since it uses as much as digits as its factorization.
201130001101 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 10.
Adding to 201130001101 its reverse (101100031102), we get a palindrome (302230032203).
The spelling of 201130001101 in words is "two hundred one billion, one hundred thirty million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •