Base | Representation |
---|---|
bin | 110011010100111000… |
… | …0010111010001011101 |
3 | 101112111120112102101022 |
4 | 1212221300113101131 |
5 | 3301213341211031 |
6 | 122345124253525 |
7 | 10651260220301 |
oct | 1465160272135 |
9 | 345446472338 |
10 | 110222210141 |
11 | 4282162295a |
12 | 194412412a5 |
13 | a51755c5b4 |
14 | 5498907d01 |
15 | 2d0188c97b |
hex | 19a9c1745d |
110222210141 has 2 divisors, whose sum is σ = 110222210142. Its totient is φ = 110222210140.
The previous prime is 110222210093. The next prime is 110222210167. The reversal of 110222210141 is 141012222011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110110485241 + 111724900 = 331829^2 + 10570^2 .
It is a cyclic number.
It is not a de Polignac number, because 110222210141 - 210 = 110222209117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110222210041) 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, 55111105070 + 55111105071.
It is an arithmetic number, because the mean of its divisors is an integer number (55111105071).
Almost surely, 2110222210141 is an apocalyptic number.
It is an amenable number.
110222210141 is a deficient number, since it is larger than the sum of its proper divisors (1).
110222210141 is an equidigital number, since it uses as much as digits as its factorization.
110222210141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 110222210141 its reverse (141012222011), we get a palindrome (251234432152).
The spelling of 110222210141 in words is "one hundred ten billion, two hundred twenty-two million, two hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •