Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0101000011010000101 |
3 | 101112012001210122212110 |
4 | 1212202132220122011 |
5 | 3300441112334341 |
6 | 122325043411233 |
7 | 10645245406026 |
oct | 1464236503205 |
9 | 345161718773 |
10 | 110100121221 |
11 | 42769714722 |
12 | 19408383b19 |
13 | a4c818392c |
14 | 5486606c4d |
15 | 2ce5cc3216 |
hex | 19a27a8685 |
110100121221 has 8 divisors (see below), whose sum is σ = 147679205184. Its totient is φ = 72960559040.
The previous prime is 110100121213. The next prime is 110100121231. The reversal of 110100121221 is 122121001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110100121221 - 23 = 110100121213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100121197 and 110100121206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100121231) 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 in 7 ways as a sum of consecutive naturals, for example, 109879860 + ... + 109880861.
It is an arithmetic number, because the mean of its divisors is an integer number (18459900648).
Almost surely, 2110100121221 is an apocalyptic number.
It is an amenable number.
110100121221 is a deficient number, since it is larger than the sum of its proper divisors (37579083963).
110100121221 is a wasteful number, since it uses less digits than its factorization.
110100121221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219760891.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110100121221 its reverse (122121001011), we get a palindrome (232221122232).
The spelling of 110100121221 in words is "one hundred ten billion, one hundred million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •