Base | Representation |
---|---|
bin | 110011010100100001… |
… | …0100011001010110001 |
3 | 101112110201221020220012 |
4 | 1212221002203022301 |
5 | 3301202302401431 |
6 | 122344015024305 |
7 | 10651053150101 |
oct | 1465102431261 |
9 | 345421836805 |
10 | 110210200241 |
11 | 4281586a719 |
12 | 1943920b095 |
13 | a514c15c4b |
14 | 549709d201 |
15 | 2d007b922b |
hex | 19a90a32b1 |
110210200241 has 2 divisors, whose sum is σ = 110210200242. Its totient is φ = 110210200240.
The previous prime is 110210200229. The next prime is 110210200319. The reversal of 110210200241 is 142002012011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69632126641 + 40578073600 = 263879^2 + 201440^2 .
It is an emirp because it is prime and its reverse (142002012011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110210200241 is a prime.
It is a super-2 number, since 2×1102102002412 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110210230241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105100120 + 55105100121.
It is an arithmetic number, because the mean of its divisors is an integer number (55105100121).
Almost surely, 2110210200241 is an apocalyptic number.
It is an amenable number.
110210200241 is a deficient number, since it is larger than the sum of its proper divisors (1).
110210200241 is an equidigital number, since it uses as much as digits as its factorization.
110210200241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110210200241 its reverse (142002012011), we get a palindrome (252212212252).
The spelling of 110210200241 in words is "one hundred ten billion, two hundred ten million, two hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •