Base | Representation |
---|---|
bin | 110011010100100100… |
… | …1110100001110010001 |
3 | 101112110212112000212201 |
4 | 1212221021310032101 |
5 | 3301203244330410 |
6 | 122344123523201 |
7 | 10651105302454 |
oct | 1465111641621 |
9 | 345425460781 |
10 | 110212105105 |
11 | 42816950893 |
12 | 19439989501 |
13 | a515431c9b |
14 | 549743749b |
15 | 2d00a4383a |
hex | 19a9274391 |
110212105105 has 8 divisors (see below), whose sum is σ = 132362145000. Its totient is φ = 88097938176.
The previous prime is 110212105097. The next prime is 110212105117. The reversal of 110212105105 is 501501212011.
It can be written as a sum of positive squares in 4 ways, for example, as 22633397136 + 87578707969 = 150444^2 + 295937^2 .
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 110212105105 - 23 = 110212105097 is a prime.
It is a super-2 number, since 2×1102121051052 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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, 8961480 + ... + 8973769.
It is an arithmetic number, because the mean of its divisors is an integer number (16545268125).
Almost surely, 2110212105105 is an apocalyptic number.
It is an amenable number.
110212105105 is a deficient number, since it is larger than the sum of its proper divisors (22150039895).
110212105105 is a wasteful number, since it uses less digits than its factorization.
110212105105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17936483.
The product of its (nonzero) digits is 100, while the sum is 19.
Adding to 110212105105 its reverse (501501212011), we get a palindrome (611713317116).
The spelling of 110212105105 in words is "one hundred ten billion, two hundred twelve million, one hundred five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •