Base | Representation |
---|---|
bin | 10000001010000011101… |
… | …001000001000110111111 |
3 | 10221010220102101122101112 |
4 | 100022003221001012333 |
5 | 121142403343130421 |
6 | 2210022555232235 |
7 | 143134343246630 |
oct | 20120351010677 |
9 | 3833812348345 |
10 | 1110310130111 |
11 | 398975139386 |
12 | 15b22874867b |
13 | 80917acc390 |
14 | 3ba4c8b9887 |
15 | 1dd35bbe45b |
hex | 10283a411bf |
1110310130111 has 64 divisors (see below), whose sum is σ = 1458588364800. Its totient is φ = 820632384000.
The previous prime is 1110310130077. The next prime is 1110310130207.
1110310130111 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-1110310130111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110310132111) 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 63 ways as a sum of consecutive naturals, for example, 112136261 + ... + 112146161.
It is an arithmetic number, because the mean of its divisors is an integer number (22790443200).
Almost surely, 21110310130111 is an apocalyptic number.
1110310130111 is a deficient number, since it is larger than the sum of its proper divisors (348278234689).
1110310130111 is a wasteful number, since it uses less digits than its factorization.
1110310130111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10840.
The product of its (nonzero) digits is 9, while the sum is 14.
It can be divided in two parts, 1110310 and 130111, that added together give a palindrome (1240421).
The spelling of 1110310130111 in words is "one trillion, one hundred ten billion, three hundred ten million, one hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •