Base | Representation |
---|---|
bin | 110011110101111011… |
… | …1101000000010000101 |
3 | 101122100212200121121112 |
4 | 1213223313220002011 |
5 | 3311001320110203 |
6 | 123051150254405 |
7 | 11020616241263 |
oct | 1475367500205 |
9 | 348325617545 |
10 | 111331410053 |
11 | 432407511a6 |
12 | 196b07b7405 |
13 | a6632b18c6 |
14 | 5561d5d433 |
15 | 2d68e3e6d8 |
hex | 19ebde8085 |
111331410053 has 4 divisors (see below), whose sum is σ = 111375261120. Its totient is φ = 111287558988.
The previous prime is 111331410049. The next prime is 111331410061. The reversal of 111331410053 is 350014133111.
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 111331410053 - 22 = 111331410049 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 (111331410083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21921725 + ... + 21926802.
It is an arithmetic number, because the mean of its divisors is an integer number (27843815280).
Almost surely, 2111331410053 is an apocalyptic number.
It is an amenable number.
111331410053 is a deficient number, since it is larger than the sum of its proper divisors (43851067).
111331410053 is an equidigital number, since it uses as much as digits as its factorization.
111331410053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43851066.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 111331410053 its reverse (350014133111), we get a palindrome (461345543164).
The spelling of 111331410053 in words is "one hundred eleven billion, three hundred thirty-one million, four hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •