Base | Representation |
---|---|
bin | 11001110001001011110100… |
… | …000001001000110010111011 |
3 | 112212021100101021210011000110 |
4 | 121301023310001020302323 |
5 | 104323304043324324011 |
6 | 1041011331123035403 |
7 | 32604621222112203 |
oct | 3161136401106273 |
9 | 485240337704013 |
10 | 113331101011131 |
11 | 331244a4a92153 |
12 | 108643b050bb63 |
13 | 4b3110013b013 |
14 | 1ddb37c707403 |
15 | d18006c24ba6 |
hex | 6712f4048cbb |
113331101011131 has 32 divisors (see below), whose sum is σ = 162783801262080. Its totient is φ = 69929528090400.
The previous prime is 113331101011091. The next prime is 113331101011133. The reversal of 113331101011131 is 131110101133311.
It is not a de Polignac number, because 113331101011131 - 29 = 113331101010619 is a prime.
It is a super-2 number, since 2×1133311010111312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113331101011098 and 113331101011107.
It is not an unprimeable number, because it can be changed into a prime (113331101011133) 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, 14861596 + ... + 21154886.
It is an arithmetic number, because the mean of its divisors is an integer number (5086993789440).
Almost surely, 2113331101011131 is an apocalyptic number.
113331101011131 is a deficient number, since it is larger than the sum of its proper divisors (49452700250949).
113331101011131 is a wasteful number, since it uses less digits than its factorization.
113331101011131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6301767.
The product of its (nonzero) digits is 81, while the sum is 21.
Adding to 113331101011131 its reverse (131110101133311), we get a palindrome (244441202144442).
The spelling of 113331101011131 in words is "one hundred thirteen trillion, three hundred thirty-one billion, one hundred one million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •