Base | Representation |
---|---|
bin | 110011101100011100… |
… | …1000000001110000001 |
3 | 101121112200112220211201 |
4 | 1213120321000032001 |
5 | 3304323312113121 |
6 | 122555413541201 |
7 | 11010001652233 |
oct | 1473071001601 |
9 | 347480486751 |
10 | 111013004161 |
11 | 43097a46134 |
12 | 19622044801 |
13 | a61233b157 |
14 | 5531958253 |
15 | 2d4aee6e91 |
hex | 19d8e40381 |
111013004161 has 4 divisors (see below), whose sum is σ = 111887122432. Its totient is φ = 110138885892.
The previous prime is 111013004111. The next prime is 111013004231. The reversal of 111013004161 is 161400310111.
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 111013004161 - 27 = 111013004033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111013004111) 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, 437058945 + ... + 437059198.
It is an arithmetic number, because the mean of its divisors is an integer number (27971780608).
Almost surely, 2111013004161 is an apocalyptic number.
It is an amenable number.
111013004161 is a deficient number, since it is larger than the sum of its proper divisors (874118271).
111013004161 is an equidigital number, since it uses as much as digits as its factorization.
111013004161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874118270.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 111013004161 its reverse (161400310111), we get a palindrome (272413314272).
The spelling of 111013004161 in words is "one hundred eleven billion, thirteen million, four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •