Base | Representation |
---|---|
bin | 11001000000110111110101… |
… | …001000100011000011011111 |
3 | 112102111221220101222211012210 |
4 | 121000313311020203003133 |
5 | 103404410223130323403 |
6 | 1025550223425531503 |
7 | 32113016601201510 |
oct | 3100676510430337 |
9 | 472457811884183 |
10 | 110011110011103 |
11 | 320644a4687a54 |
12 | 10408a821a3b93 |
13 | 4950006c36222 |
14 | 1d247cd68aa07 |
15 | cab994c82b03 |
hex | 640df52230df |
110011110011103 has 128 divisors (see below), whose sum is σ = 194252912640000. Its totient is φ = 53846869063680.
The previous prime is 110011110011093. The next prime is 110011110011107. The reversal of 110011110011103 is 301110011110011.
It is not a de Polignac number, because 110011110011103 - 25 = 110011110011071 is a prime.
It is a super-5 number, since 5×1100111100111035 (a number of 71 digits) contains 55555 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110011110011107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 37739508 + ... + 40549878.
It is an arithmetic number, because the mean of its divisors is an integer number (1517600880000).
Almost surely, 2110011110011103 is an apocalyptic number.
110011110011103 is a deficient number, since it is larger than the sum of its proper divisors (84241802628897).
110011110011103 is a wasteful number, since it uses less digits than its factorization.
110011110011103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2810645.
The product of its (nonzero) digits is 3, while the sum is 12.
Adding to 110011110011103 its reverse (301110011110011), we get a palindrome (411121121121114).
The spelling of 110011110011103 in words is "one hundred ten trillion, eleven billion, one hundred ten million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •