Base | Representation |
---|---|
bin | 110011101111010101… |
… | …1000011100010000101 |
3 | 101121210110002101020002 |
4 | 1213132223003202011 |
5 | 3310023130323023 |
6 | 123013201051045 |
7 | 11012260340111 |
oct | 1473653034205 |
9 | 347713071202 |
10 | 111110011013 |
11 | 43137782891 |
12 | 1964a626a85 |
13 | a629474461 |
14 | 55407aa741 |
15 | 2d547a9b28 |
hex | 19deac3885 |
111110011013 has 8 divisors (see below), whose sum is σ = 113045165376. Its totient is φ = 109191326400.
The previous prime is 111110011009. The next prime is 111110011021. The reversal of 111110011013 is 310110011111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111110011013 - 22 = 111110011009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111110010985 and 111110011003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111110011003) 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 7 ways as a sum of consecutive naturals, for example, 4103828 + ... + 4130813.
It is an arithmetic number, because the mean of its divisors is an integer number (14130645672).
Almost surely, 2111110011013 is an apocalyptic number.
It is an amenable number.
111110011013 is a deficient number, since it is larger than the sum of its proper divisors (1935154363).
111110011013 is a wasteful number, since it uses less digits than its factorization.
111110011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8234875.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 111110011013 its reverse (310110011111), we get a palindrome (421220022124).
The spelling of 111110011013 in words is "one hundred eleven billion, one hundred ten million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •