Base | Representation |
---|---|
bin | 11001101100110100100111… |
… | …001001000000001010100111 |
3 | 112211012200120101222200011102 |
4 | 121230310213021000022213 |
5 | 104303401111104001411 |
6 | 1040221511210430315 |
7 | 32544146154056621 |
oct | 3154644711001247 |
9 | 484180511880142 |
10 | 113031311000231 |
11 | 33019345380868 |
12 | 1081628543239b |
13 | 4b0ba64983320 |
14 | 1dcaa5d427c11 |
15 | d1030cbe4d3b |
hex | 66cd272402a7 |
113031311000231 has 32 divisors (see below), whose sum is σ = 127709448007680. Its totient is φ = 99258739138944.
The previous prime is 113031311000159. The next prime is 113031311000249. The reversal of 113031311000231 is 132000113130311.
It is a cyclic number.
It is not a de Polignac number, because 113031311000231 - 222 = 113031306805927 is a prime.
It is a super-2 number, since 2×1130313110002312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113031311000261) 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, 40251506 + ... + 42967968.
It is an arithmetic number, because the mean of its divisors is an integer number (3990920250240).
Almost surely, 2113031311000231 is an apocalyptic number.
113031311000231 is a deficient number, since it is larger than the sum of its proper divisors (14678137007449).
113031311000231 is a wasteful number, since it uses less digits than its factorization.
113031311000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2717255.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 113031311000231 its reverse (132000113130311), we get a palindrome (245031424130542).
The spelling of 113031311000231 in words is "one hundred thirteen trillion, thirty-one billion, three hundred eleven million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •