Base | Representation |
---|---|
bin | 11001000010010100000111… |
… | …111101011000111101111000 |
3 | 112102212102200212022000000211 |
4 | 121002110013331120331320 |
5 | 103413021202241213422 |
6 | 1030103533204440504 |
7 | 32123125440104644 |
oct | 3102240775307570 |
9 | 472772625260024 |
10 | 110110210101112 |
11 | 320a2529042391 |
12 | 1042411a6a9134 |
13 | 495946b181240 |
14 | 1d29510db5c24 |
15 | cae344eac577 |
hex | 642507f58f78 |
110110210101112 has 32 divisors (see below), whose sum is σ = 234039920259600. Its totient is φ = 48145355023104.
The previous prime is 110110210101109. The next prime is 110110210101211. The reversal of 110110210101112 is 211101012011011.
It is a super-2 number, since 2×1101102101011122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 110110210101092 and 110110210101101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27861893293 + ... + 27861897244.
Almost surely, 2110110210101112 is an apocalyptic number.
It is an amenable number.
110110210101112 is an abundant number, since it is smaller than the sum of its proper divisors (123929710158488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110210101112 is a wasteful number, since it uses less digits than its factorization.
110110210101112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55723790575 (or 55723790571 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110110210101112 its reverse (211101012011011), we get a palindrome (321211222112123).
The spelling of 110110210101112 in words is "one hundred ten trillion, one hundred ten billion, two hundred ten million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •