Base | Representation |
---|---|
bin | 101101101110101101011101… |
… | …011011101001110100101001 |
3 | 222101010002001001122111210102 |
4 | 231232231131123221310221 |
5 | 202330140324240200243 |
6 | 1551430101034555145 |
7 | 60235404451312124 |
oct | 5556553533516451 |
9 | 871102031574712 |
10 | 201122001100073 |
11 | 590a13a8421479 |
12 | 1a68295b298ab5 |
13 | 882b9531b2a61 |
14 | 37944dd0773bb |
15 | 183b9a12d99b8 |
hex | b6eb5d6e9d29 |
201122001100073 has 2 divisors, whose sum is σ = 201122001100074. Its totient is φ = 201122001100072.
The previous prime is 201122001100063. The next prime is 201122001100087. The reversal of 201122001100073 is 370001100221102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 191030876817664 + 10091124282409 = 13821392^2 + 3176653^2 .
It is a cyclic number.
It is not a de Polignac number, because 201122001100073 - 234 = 201104821230889 is a prime.
It is not a weakly prime, because it can be changed into another prime (201122001100063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100561000550036 + 100561000550037.
It is an arithmetic number, because the mean of its divisors is an integer number (100561000550037).
Almost surely, 2201122001100073 is an apocalyptic number.
It is an amenable number.
201122001100073 is a deficient number, since it is larger than the sum of its proper divisors (1).
201122001100073 is an equidigital number, since it uses as much as digits as its factorization.
201122001100073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 201122001100073 its reverse (370001100221102), we get a palindrome (571123101321175).
The spelling of 201122001100073 in words is "two hundred one trillion, one hundred twenty-two billion, one million, one hundred thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •