Base | Representation |
---|---|
bin | 11001010101001110110001… |
… | …011010010000100111111101 |
3 | 112121110201000201211112012222 |
4 | 121111032301122100213331 |
5 | 104100320423041021023 |
6 | 1032541035242535125 |
7 | 32316054646456646 |
oct | 3125166132204775 |
9 | 477421021745188 |
10 | 111410133142013 |
11 | 32553854780012 |
12 | 105b40442074a5 |
13 | 4a21c13341444 |
14 | 1d723ca24a6cd |
15 | cd307727ecc8 |
hex | 6553b16909fd |
111410133142013 has 8 divisors (see below), whose sum is σ = 113187510737280. Its totient is φ = 109645588598400.
The previous prime is 111410133141959. The next prime is 111410133142081. The reversal of 111410133142013 is 310241331014111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111410133142013 - 210 = 111410133140989 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 (111410133142093) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3208245413 + ... + 3208280138.
It is an arithmetic number, because the mean of its divisors is an integer number (14148438842160).
Almost surely, 2111410133142013 is an apocalyptic number.
It is an amenable number.
111410133142013 is a deficient number, since it is larger than the sum of its proper divisors (1777377595267).
111410133142013 is an equidigital number, since it uses as much as digits as its factorization.
111410133142013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6416525827.
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 111410133142013 its reverse (310241331014111), we get a palindrome (421651464156124).
The spelling of 111410133142013 in words is "one hundred eleven trillion, four hundred ten billion, one hundred thirty-three million, one hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •