Base | Representation |
---|---|
bin | 1011110101010110001010… |
… | …1101010111101001101111 |
3 | 1201001211221202200121210011 |
4 | 2331111202231113221233 |
5 | 3201133224133000421 |
6 | 43401120005154051 |
7 | 2512010325136231 |
oct | 275254255275157 |
9 | 51054852617704 |
10 | 13011112000111 |
11 | 4166a88585965 |
12 | 15617830bb927 |
13 | 734c33b68604 |
14 | 32da53b2c251 |
15 | 1786aee9b4e1 |
hex | bd562b57a6f |
13011112000111 has 8 divisors (see below), whose sum is σ = 13035260819664. Its totient is φ = 12986973088320.
The previous prime is 13011112000079. The next prime is 13011112000171. The reversal of 13011112000111 is 11100021111031.
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 13011112000111 - 25 = 13011112000079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13011112000091 and 13011112000100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13011112000171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154536 + ... + 5103538.
It is an arithmetic number, because the mean of its divisors is an integer number (1629407602458).
Almost surely, 213011112000111 is an apocalyptic number.
13011112000111 is a deficient number, since it is larger than the sum of its proper divisors (24148819553).
13011112000111 is an equidigital number, since it uses as much as digits as its factorization.
13011112000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4953881.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 13011112000111 its reverse (11100021111031), we get a palindrome (24111133111142).
The spelling of 13011112000111 in words is "thirteen trillion, eleven billion, one hundred twelve million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •