Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …1000010000010011001 |
3 | 201012211211010001111222 |
4 | 2323031031002002121 |
5 | 11243132334203423 |
6 | 232202052301425 |
7 | 20344150233554 |
oct | 2731515020231 |
9 | 635754101458 |
10 | 201011241113 |
11 | 78280672661 |
12 | 32b5a311875 |
13 | 15c55993ab7 |
14 | 9a2c51769b |
15 | 53671263c8 |
hex | 2ecd342099 |
201011241113 has 2 divisors, whose sum is σ = 201011241114. Its totient is φ = 201011241112.
The previous prime is 201011241107. The next prime is 201011241257. The reversal of 201011241113 is 311142110102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 176726070544 + 24285170569 = 420388^2 + 155837^2 .
It is a cyclic number.
It is not a de Polignac number, because 201011241113 - 24 = 201011241097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201011241091 and 201011241100.
It is not a weakly prime, because it can be changed into another prime (201011241313) 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, 100505620556 + 100505620557.
It is an arithmetic number, because the mean of its divisors is an integer number (100505620557).
Almost surely, 2201011241113 is an apocalyptic number.
It is an amenable number.
201011241113 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011241113 is an equidigital number, since it uses as much as digits as its factorization.
201011241113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 201011241113 its reverse (311142110102), we get a palindrome (512153351215).
The spelling of 201011241113 in words is "two hundred one billion, eleven million, two hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •