Base | Representation |
---|---|
bin | 1011101101001010010… |
… | …0001100111000010001 |
3 | 201020002002101111011102 |
4 | 2323102210030320101 |
5 | 11243323401412123 |
6 | 232215024354145 |
7 | 20346322001204 |
oct | 2732244147021 |
9 | 636062344142 |
10 | 201101200913 |
11 | 783174267a8 |
12 | 32b84475955 |
13 | 15c6b500652 |
14 | 9a3a45393b |
15 | 536ee96028 |
hex | 2ed290ce11 |
201101200913 has 2 divisors, whose sum is σ = 201101200914. Its totient is φ = 201101200912.
The previous prime is 201101200891. The next prime is 201101200943. The reversal of 201101200913 is 319002101102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 183520562449 + 17580638464 = 428393^2 + 132592^2 .
It is a cyclic number.
It is not a de Polignac number, because 201101200913 - 222 = 201097006609 is a prime.
It is not a weakly prime, because it can be changed into another prime (201101200943) 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, 100550600456 + 100550600457.
It is an arithmetic number, because the mean of its divisors is an integer number (100550600457).
Almost surely, 2201101200913 is an apocalyptic number.
It is an amenable number.
201101200913 is a deficient number, since it is larger than the sum of its proper divisors (1).
201101200913 is an equidigital number, since it uses as much as digits as its factorization.
201101200913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
The spelling of 201101200913 in words is "two hundred one billion, one hundred one million, two hundred thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •