Base | Representation |
---|---|
bin | 1011101101001111101… |
… | …1010000000100001011 |
3 | 201020010200022211201222 |
4 | 2323103323100010023 |
5 | 11243400222123431 |
6 | 232221201432255 |
7 | 20350016652452 |
oct | 2732373200413 |
9 | 636120284658 |
10 | 201124020491 |
11 | 783292a2459 |
12 | 32b9003b68b |
13 | 15c73160264 |
14 | 9a3d4b3b99 |
15 | 5371ea257b |
hex | 2ed3ed010b |
201124020491 has 2 divisors, whose sum is σ = 201124020492. Its totient is φ = 201124020490.
The previous prime is 201124020413. The next prime is 201124020511. The reversal of 201124020491 is 194020421102.
201124020491 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201124020491 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201124020491.
It is not a weakly prime, because it can be changed into another prime (201124020401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100562010245 + 100562010246.
It is an arithmetic number, because the mean of its divisors is an integer number (100562010246).
Almost surely, 2201124020491 is an apocalyptic number.
201124020491 is a deficient number, since it is larger than the sum of its proper divisors (1).
201124020491 is an equidigital number, since it uses as much as digits as its factorization.
201124020491 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 201124020491 its reverse (194020421102), we get a palindrome (395144441593).
The spelling of 201124020491 in words is "two hundred one billion, one hundred twenty-four million, twenty thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •