Base | Representation |
---|---|
bin | 110011010100100011… |
… | …0011010001101000101 |
3 | 101112110210211122220111 |
4 | 1212221012122031011 |
5 | 3301203032241401 |
6 | 122344052433021 |
7 | 10651064563114 |
oct | 1465106321505 |
9 | 345423748814 |
10 | 110211212101 |
11 | 428163a0971 |
12 | 19439618771 |
13 | a5151ab693 |
14 | 5497283c7b |
15 | 2d00918e51 |
hex | 19a919a345 |
110211212101 has 2 divisors, whose sum is σ = 110211212102. Its totient is φ = 110211212100.
The previous prime is 110211212081. The next prime is 110211212131. The reversal of 110211212101 is 101212112011.
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., 88804596001 + 21406616100 = 298001^2 + 146310^2 .
It is a cyclic number.
It is not a de Polignac number, because 110211212101 - 221 = 110209114949 is a prime.
It is a super-2 number, since 2×1102112121012 (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 (110211212131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105606050 + 55105606051.
It is an arithmetic number, because the mean of its divisors is an integer number (55105606051).
Almost surely, 2110211212101 is an apocalyptic number.
It is an amenable number.
110211212101 is a deficient number, since it is larger than the sum of its proper divisors (1).
110211212101 is an equidigital number, since it uses as much as digits as its factorization.
110211212101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110211212101 its reverse (101212112011), we get a palindrome (211423324112).
The spelling of 110211212101 in words is "one hundred ten billion, two hundred eleven million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •