Base | Representation |
---|---|
bin | 10000001010110100100… |
… | …101100100100011011101 |
3 | 10221020000122120220211122 |
4 | 100022310211210203131 |
5 | 121201044103412201 |
6 | 2210240252100325 |
7 | 143163604206155 |
oct | 20126445444335 |
9 | 3836018526748 |
10 | 1111131310301 |
11 | 3992567261a1 |
12 | 15b4177646a5 |
13 | 80a18c8990c |
14 | 3bac9999765 |
15 | 1dd82d2be1b |
hex | 102b49648dd |
1111131310301 has 32 divisors (see below), whose sum is σ = 1221267024000. Its totient is φ = 1006882507008.
The previous prime is 1111131310297. The next prime is 1111131310309. The reversal of 1111131310301 is 1030131311111.
It is a cyclic number.
It is not a de Polignac number, because 1111131310301 - 22 = 1111131310297 is a prime.
It is a super-2 number, since 2×11111313103012 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1111131310301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111131310309) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26955815 + ... + 26997003.
It is an arithmetic number, because the mean of its divisors is an integer number (38164594500).
Almost surely, 21111131310301 is an apocalyptic number.
It is an amenable number.
1111131310301 is a deficient number, since it is larger than the sum of its proper divisors (110135713699).
1111131310301 is a wasteful number, since it uses less digits than its factorization.
1111131310301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41693.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 1111131310301 its reverse (1030131311111), we get a palindrome (2141262621412).
The spelling of 1111131310301 in words is "one trillion, one hundred eleven billion, one hundred thirty-one million, three hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •