Base | Representation |
---|---|
bin | 110011010100100010… |
… | …1101001011001000001 |
3 | 101112110210110111122022 |
4 | 1212221011221121001 |
5 | 3301203004342121 |
6 | 122344044251225 |
7 | 10651063101155 |
oct | 1465105513101 |
9 | 345423414568 |
10 | 110211012161 |
11 | 42816274728 |
12 | 19439540b15 |
13 | a51513b683 |
14 | 5497231065 |
15 | 2d008c9aab |
hex | 19a9169641 |
110211012161 has 2 divisors, whose sum is σ = 110211012162. Its totient is φ = 110211012160.
The previous prime is 110211012157. The next prime is 110211012239. The reversal of 110211012161 is 161210112011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90024001600 + 20187010561 = 300040^2 + 142081^2 .
It is a cyclic number.
It is not a de Polignac number, because 110211012161 - 22 = 110211012157 is a prime.
It is a super-3 number, since 3×1102110121613 (a number of 34 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (110211012061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105506080 + 55105506081.
It is an arithmetic number, because the mean of its divisors is an integer number (55105506081).
Almost surely, 2110211012161 is an apocalyptic number.
It is an amenable number.
110211012161 is a deficient number, since it is larger than the sum of its proper divisors (1).
110211012161 is an equidigital number, since it uses as much as digits as its factorization.
110211012161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 110211012161 its reverse (161210112011), we get a palindrome (271421124172).
The spelling of 110211012161 in words is "one hundred ten billion, two hundred eleven million, twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •