Base | Representation |
---|---|
bin | 11001010101001110110001… |
… | …110101001110011101000101 |
3 | 112121110201001020010200001210 |
4 | 121111032301311032131011 |
5 | 104100320431343223023 |
6 | 1032541040054242033 |
7 | 32316055063531200 |
oct | 3125166165163505 |
9 | 477421036120053 |
10 | 111410140211013 |
11 | 32553858769066 |
12 | 105b4046656319 |
13 | 4a21c14947b97 |
14 | 1d723cb16a937 |
15 | cd3077bc9593 |
hex | 6553b1d4e745 |
111410140211013 has 12 divisors (see below), whose sum is σ = 172799401143840. Its totient is φ = 63662937263352.
The previous prime is 111410140211009. The next prime is 111410140211087. The reversal of 111410140211013 is 310112041014111.
It is not a de Polignac number, because 111410140211013 - 22 = 111410140211009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111410140216013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 378946054993 + ... + 378946055286.
It is an arithmetic number, because the mean of its divisors is an integer number (14399950095320).
Almost surely, 2111410140211013 is an apocalyptic number.
It is an amenable number.
111410140211013 is a deficient number, since it is larger than the sum of its proper divisors (61389260932827).
111410140211013 is an equidigital number, since it uses as much as digits as its factorization.
111410140211013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 757892110296 (or 757892110289 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 21.
Adding to 111410140211013 its reverse (310112041014111), we get a palindrome (421522181225124).
The spelling of 111410140211013 in words is "one hundred eleven trillion, four hundred ten billion, one hundred forty million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •