Base | Representation |
---|---|
bin | 1011101101001010000… |
… | …0110011011110101001 |
3 | 201020002000201020122222 |
4 | 2323102200303132221 |
5 | 11243323134413231 |
6 | 232214553323425 |
7 | 20346311302112 |
oct | 2732240633651 |
9 | 636060636588 |
10 | 201100310441 |
11 | 78316978778 |
12 | 32b84106575 |
13 | 15c6b27b244 |
14 | 9a3a2a1209 |
15 | 536ed6c27b |
hex | 2ed28337a9 |
201100310441 has 2 divisors, whose sum is σ = 201100310442. Its totient is φ = 201100310440.
The previous prime is 201100310407. The next prime is 201100310443. The reversal of 201100310441 is 144013001102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144472969216 + 56627341225 = 380096^2 + 237965^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201100310441 is a prime.
It is a super-2 number, since 2×2011003104412 (a number of 23 digits) contains 22 as substring.
Together with 201100310443, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (201100310443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550155220 + 100550155221.
It is an arithmetic number, because the mean of its divisors is an integer number (100550155221).
Almost surely, 2201100310441 is an apocalyptic number.
It is an amenable number.
201100310441 is a deficient number, since it is larger than the sum of its proper divisors (1).
201100310441 is an equidigital number, since it uses as much as digits as its factorization.
201100310441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 201100310441 its reverse (144013001102), we get a palindrome (345113311543).
The spelling of 201100310441 in words is "two hundred one billion, one hundred million, three hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •