Base | Representation |
---|---|
bin | 11001101111011100001001… |
… | …010111001101000101101011 |
3 | 112211211212220011221101011111 |
4 | 121233130021113031011223 |
5 | 104314323014202030011 |
6 | 1040440301325011151 |
7 | 32563145034446524 |
oct | 3157341127150553 |
9 | 484755804841144 |
10 | 113211200033131 |
11 | 330886670107a2 |
12 | 108451099b3ab7 |
13 | 4b22a02614265 |
14 | 1dd56465b984b |
15 | d14d3a7ce121 |
hex | 66f7095cd16b |
113211200033131 has 8 divisors (see below), whose sum is σ = 118693300184064. Its totient is φ = 107775756054120.
The previous prime is 113211200033119. The next prime is 113211200033179. The reversal of 113211200033131 is 131330002112311.
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 113211200033131 - 225 = 113211166478699 is a prime.
It is a super-2 number, since 2×1132112000331312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113211200036131) 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, 11664038011 + ... + 11664047716.
It is an arithmetic number, because the mean of its divisors is an integer number (14836662523008).
Almost surely, 2113211200033131 is an apocalyptic number.
113211200033131 is a deficient number, since it is larger than the sum of its proper divisors (5482100150933).
113211200033131 is a wasteful number, since it uses less digits than its factorization.
113211200033131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23328085961.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 113211200033131 its reverse (131330002112311), we get a palindrome (244541202145442).
The spelling of 113211200033131 in words is "one hundred thirteen trillion, two hundred eleven billion, two hundred million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •