Base | Representation |
---|---|
bin | 10000001010110011011… |
… | …011111100101001001111 |
3 | 10221012222022021101020111 |
4 | 100022303123330221033 |
5 | 121201024133312234 |
6 | 2210234322300451 |
7 | 143163251154043 |
oct | 20126333745117 |
9 | 3835868241214 |
10 | 1111112010319 |
11 | 3992468438a3 |
12 | 15b4111b7727 |
13 | 80a14c8cccc |
14 | 3bac71b4023 |
15 | 1dd812b8664 |
hex | 102b36fca4f |
1111112010319 has 4 divisors (see below), whose sum is σ = 1111158658800. Its totient is φ = 1111065361840.
The previous prime is 1111112010317. The next prime is 1111112010347. The reversal of 1111112010319 is 9130102111111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1111112010319 - 21 = 1111112010317 is a prime.
It is a super-3 number, since 3×11111120103193 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1111112010319.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111112010317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23288494 + ... + 23336155.
It is an arithmetic number, because the mean of its divisors is an integer number (277789664700).
Almost surely, 21111112010319 is an apocalyptic number.
1111112010319 is a deficient number, since it is larger than the sum of its proper divisors (46648481).
1111112010319 is an equidigital number, since it uses as much as digits as its factorization.
1111112010319 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46648480.
The product of its (nonzero) digits is 54, while the sum is 22.
The spelling of 1111112010319 in words is "one trillion, one hundred eleven billion, one hundred twelve million, ten thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •