Base | Representation |
---|---|
bin | 110011111011011000… |
… | …1011000110011110101 |
3 | 101122211121212121200001 |
4 | 1213312301120303311 |
5 | 3311340131333323 |
6 | 123121242551301 |
7 | 11025300054565 |
oct | 1476661306365 |
9 | 348747777601 |
10 | 111514324213 |
11 | 43324a24326 |
12 | 19741b08531 |
13 | a692166036 |
14 | 557c374da5 |
15 | 2d7a0213ad |
hex | 19f6c58cf5 |
111514324213 has 4 divisors (see below), whose sum is σ = 111531077280. Its totient is φ = 111497571148.
The previous prime is 111514324189. The next prime is 111514324231. The reversal of 111514324213 is 312423415111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 312423415111 = 31 ⋅10078174681.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111514324213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111514324253) 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, 8366545 + ... + 8379862.
It is an arithmetic number, because the mean of its divisors is an integer number (27882769320).
Almost surely, 2111514324213 is an apocalyptic number.
It is an amenable number.
111514324213 is a deficient number, since it is larger than the sum of its proper divisors (16753067).
111514324213 is an equidigital number, since it uses as much as digits as its factorization.
111514324213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16753066.
The product of its digits is 2880, while the sum is 28.
Adding to 111514324213 its reverse (312423415111), we get a palindrome (423937739324).
The spelling of 111514324213 in words is "one hundred eleven billion, five hundred fourteen million, three hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •