Base | Representation |
---|---|
bin | 1011101100111100101… |
… | …1100110101000111101 |
3 | 201012221010112210000101 |
4 | 2323033023212220331 |
5 | 11243214332434211 |
6 | 232205235401101 |
7 | 20345032245502 |
oct | 2731713465075 |
9 | 635833483011 |
10 | 201044421181 |
11 | 782983752aa |
12 | 32b69453191 |
13 | 15c5c810386 |
14 | 9a32ab34a9 |
15 | 5369ecc5c1 |
hex | 2ecf2e6a3d |
201044421181 has 2 divisors, whose sum is σ = 201044421182. Its totient is φ = 201044421180.
The previous prime is 201044421173. The next prime is 201044421187. The reversal of 201044421181 is 181124440102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117471393081 + 83573028100 = 342741^2 + 289090^2 .
It is a cyclic number.
It is not a de Polignac number, because 201044421181 - 23 = 201044421173 is a prime.
It is a super-2 number, since 2×2010444211812 (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 (201044421187) 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, 100522210590 + 100522210591.
It is an arithmetic number, because the mean of its divisors is an integer number (100522210591).
Almost surely, 2201044421181 is an apocalyptic number.
It is an amenable number.
201044421181 is a deficient number, since it is larger than the sum of its proper divisors (1).
201044421181 is an equidigital number, since it uses as much as digits as its factorization.
201044421181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2048, while the sum is 28.
Adding to 201044421181 its reverse (181124440102), we get a palindrome (382168861283).
The spelling of 201044421181 in words is "two hundred one billion, forty-four million, four hundred twenty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •