Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …001111110100000101111 |
3 | 10221010002210211120010122 |
4 | 100021301021332200233 |
5 | 121141240000044434 |
6 | 2205532120155155 |
7 | 143123556231410 |
oct | 20116111764057 |
9 | 3833083746118 |
10 | 1110000003119 |
11 | 398826078387 |
12 | 15b160908abb |
13 | 80898796c97 |
14 | 3ba1d62b807 |
15 | 1dd1885ec2e |
hex | 1027127e82f |
1110000003119 has 4 divisors (see below), whose sum is σ = 1268571432144. Its totient is φ = 951428574096.
The previous prime is 1110000003043. The next prime is 1110000003193. The reversal of 1110000003119 is 9113000000111.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-1110000003119 is a prime.
It is a super-2 number, since 2×11100000031192 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110000003097 and 1110000003106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110000003319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79285714502 + ... + 79285714515.
It is an arithmetic number, because the mean of its divisors is an integer number (317142858036).
Almost surely, 21110000003119 is an apocalyptic number.
1110000003119 is a deficient number, since it is larger than the sum of its proper divisors (158571429025).
1110000003119 is an equidigital number, since it uses as much as digits as its factorization.
1110000003119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158571429024.
The product of its (nonzero) digits is 27, while the sum is 17.
The spelling of 1110000003119 in words is "one trillion, one hundred ten billion, three thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •