Base | Representation |
---|---|
bin | 110100101010101001… |
… | …1100001100011011111 |
3 | 101210221011020010021201 |
4 | 1221111103201203133 |
5 | 3323112141044411 |
6 | 123542500340331 |
7 | 11112505645006 |
oct | 1512523414337 |
9 | 353834203251 |
10 | 113100331231 |
11 | 43a69208928 |
12 | 19b050a46a7 |
13 | a88590c924 |
14 | 568cc65c3d |
15 | 2e1e3a93c1 |
hex | 1a554e18df |
113100331231 has 8 divisors (see below), whose sum is σ = 114934090464. Its totient is φ = 111281184000.
The previous prime is 113100331193. The next prime is 113100331241. The reversal of 113100331231 is 132133001311.
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 113100331231 - 27 = 113100331103 is a prime.
It is a super-2 number, since 2×1131003312312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113100331199 and 113100331208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113100331241) 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, 3637395 + ... + 3668356.
It is an arithmetic number, because the mean of its divisors is an integer number (14366761308).
Almost surely, 2113100331231 is an apocalyptic number.
113100331231 is a deficient number, since it is larger than the sum of its proper divisors (1833759233).
113100331231 is a wasteful number, since it uses less digits than its factorization.
113100331231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7306001.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 113100331231 its reverse (132133001311), we get a palindrome (245233332542).
The spelling of 113100331231 in words is "one hundred thirteen billion, one hundred million, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •