Base | Representation |
---|---|
bin | 11001000010010100001000… |
… | …000001100111111111000001 |
3 | 112102212102200221101101210020 |
4 | 121002110020001213333001 |
5 | 103413021203032224301 |
6 | 1030103533244324053 |
7 | 32123125452410235 |
oct | 3102241001477701 |
9 | 472772627341706 |
10 | 110110211211201 |
11 | 320a2529730413 |
12 | 1042411ab43629 |
13 | 495946b47c5b6 |
14 | 1d295111c45c5 |
15 | cae34512b436 |
hex | 642508067fc1 |
110110211211201 has 64 divisors (see below), whose sum is σ = 156516582942720. Its totient is φ = 68734460390400.
The previous prime is 110110211211197. The next prime is 110110211211211. The reversal of 110110211211201 is 102112112011011.
It is not a de Polignac number, because 110110211211201 - 22 = 110110211211197 is a prime.
It is a super-2 number, since 2×1101102112112012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110110211211211) 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 in 63 ways as a sum of consecutive naturals, for example, 551551801 + ... + 551751401.
It is an arithmetic number, because the mean of its divisors is an integer number (2445571608480).
Almost surely, 2110110211211201 is an apocalyptic number.
It is an amenable number.
110110211211201 is a deficient number, since it is larger than the sum of its proper divisors (46406371731519).
110110211211201 is a wasteful number, since it uses less digits than its factorization.
110110211211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200726.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 110110211211201 its reverse (102112112011011), we get a palindrome (212222323222212).
The spelling of 110110211211201 in words is "one hundred ten trillion, one hundred ten billion, two hundred eleven million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •