Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …1001100000001001011 |
3 | 201020010120100002102211 |
4 | 2323103311030001023 |
5 | 11243344320243201 |
6 | 232221103405551 |
7 | 20350000312513 |
oct | 2732365140113 |
9 | 636116302384 |
10 | 201122431051 |
11 | 78328407273 |
12 | 32b8b5b38b7 |
13 | 15c72a24969 |
14 | 9a3d1bc843 |
15 | 5371c8b651 |
hex | 2ed3d4c04b |
201122431051 has 2 divisors, whose sum is σ = 201122431052. Its totient is φ = 201122431050.
The previous prime is 201122431009. The next prime is 201122431061. The reversal of 201122431051 is 150134221102.
201122431051 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 not a de Polignac number, because 201122431051 - 211 = 201122429003 is a prime.
It is not a weakly prime, because it can be changed into another prime (201122431061) 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, 100561215525 + 100561215526.
It is an arithmetic number, because the mean of its divisors is an integer number (100561215526).
Almost surely, 2201122431051 is an apocalyptic number.
201122431051 is a deficient number, since it is larger than the sum of its proper divisors (1).
201122431051 is an equidigital number, since it uses as much as digits as its factorization.
201122431051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 201122431051 its reverse (150134221102), we get a palindrome (351256652153).
The spelling of 201122431051 in words is "two hundred one billion, one hundred twenty-two million, four hundred thirty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •