Base | Representation |
---|---|
bin | 1101010001010… |
… | …00010011001001 |
3 | 21202110100021020 |
4 | 12220220103021 |
5 | 211444022441 |
6 | 15013503053 |
7 | 2521103652 |
oct | 650502311 |
9 | 252410236 |
10 | 111314121 |
11 | 57919a46 |
12 | 31341a89 |
13 | 1a0a5559 |
14 | 10ad8529 |
15 | 9b8be66 |
hex | 6a284c9 |
111314121 has 4 divisors (see below), whose sum is σ = 148418832. Its totient is φ = 74209412.
The previous prime is 111314117. The next prime is 111314129. The reversal of 111314121 is 121413111.
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 111314121 - 22 = 111314117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111314121.
It is not an unprimeable number, because it can be changed into a prime (111314129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18552351 + ... + 18552356.
It is an arithmetic number, because the mean of its divisors is an integer number (37104708).
Almost surely, 2111314121 is an apocalyptic number.
It is an amenable number.
111314121 is a deficient number, since it is larger than the sum of its proper divisors (37104711).
111314121 is an equidigital number, since it uses as much as digits as its factorization.
111314121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37104710.
The product of its digits is 24, while the sum is 15.
The square root of 111314121 is about 10550.5507439185. The cubic root of 111314121 is about 481.0424695566.
Adding to 111314121 its reverse (121413111), we get a palindrome (232727232).
The spelling of 111314121 in words is "one hundred eleven million, three hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •