Base | Representation |
---|---|
bin | 11001010011110001101000… |
… | …010011001011101000111101 |
3 | 112121010010212210210110021210 |
4 | 121103301220103023220331 |
5 | 104042201112302131023 |
6 | 1032423055251315033 |
7 | 32305614411402645 |
oct | 3123615023135075 |
9 | 477103783713253 |
10 | 111310122302013 |
11 | 325153a3210738 |
12 | 105987928aba79 |
13 | 4a156655079cb |
14 | 1d6b61d9a7525 |
15 | cd0672103593 |
hex | 653c684cba3d |
111310122302013 has 16 divisors (see below), whose sum is σ = 150929538154560. Its totient is φ = 72948736638336.
The previous prime is 111310122301979. The next prime is 111310122302083. The reversal of 111310122302013 is 310203221013111.
111310122302013 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 111310122302013 - 212 = 111310122297917 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111310122302083) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54197631 + ... + 56213907.
It is an arithmetic number, because the mean of its divisors is an integer number (9433096134660).
Almost surely, 2111310122302013 is an apocalyptic number.
It is an amenable number.
111310122302013 is a deficient number, since it is larger than the sum of its proper divisors (39619415852547).
111310122302013 is a wasteful number, since it uses less digits than its factorization.
111310122302013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2328236.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 111310122302013 its reverse (310203221013111), we get a palindrome (421513343315124).
The spelling of 111310122302013 in words is "one hundred eleven trillion, three hundred ten billion, one hundred twenty-two million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •