Base | Representation |
---|---|
bin | 110011110101010011… |
… | …0000010010101111101 |
3 | 101122022101102222201220 |
4 | 1213222212002111331 |
5 | 3310430331201023 |
6 | 123045104023553 |
7 | 11020236401421 |
oct | 1475246022575 |
9 | 348271388656 |
10 | 111310022013 |
11 | 4322a673033 |
12 | 196a5601bb9 |
13 | a65ba33768 |
14 | 555d192b81 |
15 | 2d671173e3 |
hex | 19ea98257d |
111310022013 has 4 divisors (see below), whose sum is σ = 148413362688. Its totient is φ = 74206681340.
The previous prime is 111310022011. The next prime is 111310022017. The reversal of 111310022013 is 310220013111.
It is a happy number.
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.
It is a cyclic number.
It is not a de Polignac number, because 111310022013 - 21 = 111310022011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111310021983 and 111310022001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111310022011) 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, 18551670333 + ... + 18551670338.
It is an arithmetic number, because the mean of its divisors is an integer number (37103340672).
Almost surely, 2111310022013 is an apocalyptic number.
It is an amenable number.
111310022013 is a deficient number, since it is larger than the sum of its proper divisors (37103340675).
111310022013 is an equidigital number, since it uses as much as digits as its factorization.
111310022013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37103340674.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 111310022013 its reverse (310220013111), we get a palindrome (421530035124).
The spelling of 111310022013 in words is "one hundred eleven billion, three hundred ten million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •