Base | Representation |
---|---|
bin | 1011101101010011100… |
… | …1011011101101001101 |
3 | 201020011210222222222021 |
4 | 2323110321123231031 |
5 | 11243413410233401 |
6 | 232222543050141 |
7 | 20350305343216 |
oct | 2732471335515 |
9 | 636153888867 |
10 | 201140321101 |
11 | 78337516335 |
12 | 32b955a0951 |
13 | 15c766498a5 |
14 | 9a4171840d |
15 | 53736222a1 |
hex | 2ed4e5bb4d |
201140321101 has 2 divisors, whose sum is σ = 201140321102. Its totient is φ = 201140321100.
The previous prime is 201140321071. The next prime is 201140321153. The reversal of 201140321101 is 101123041102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128859460900 + 72280860201 = 358970^2 + 268851^2 .
It is a cyclic number.
It is not a de Polignac number, because 201140321101 - 25 = 201140321069 is a prime.
It is a super-2 number, since 2×2011403211012 (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 (201140321191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100570160550 + 100570160551.
It is an arithmetic number, because the mean of its divisors is an integer number (100570160551).
Almost surely, 2201140321101 is an apocalyptic number.
It is an amenable number.
201140321101 is a deficient number, since it is larger than the sum of its proper divisors (1).
201140321101 is an equidigital number, since it uses as much as digits as its factorization.
201140321101 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 16.
Adding to 201140321101 its reverse (101123041102), we get a palindrome (302263362203).
The spelling of 201140321101 in words is "two hundred one billion, one hundred forty million, three hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •