Base | Representation |
---|---|
bin | 110100101011101000… |
… | …0001110101110110011 |
3 | 101211000102201222202210 |
4 | 1221113100032232303 |
5 | 3323144023202011 |
6 | 123550025143203 |
7 | 11113353551523 |
oct | 1512720165663 |
9 | 354012658683 |
10 | 113133022131 |
11 | 43a85706aa8 |
12 | 19b1402ab03 |
13 | a88c61765c |
14 | 5693335683 |
15 | 2e221b56a6 |
hex | 1a5740ebb3 |
113133022131 has 16 divisors (see below), whose sum is σ = 152207811360. Its totient is φ = 74740377600.
The previous prime is 113133022129. The next prime is 113133022133. The reversal of 113133022131 is 131220331311.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (113133022129) and next prime (113133022133).
It is not a de Polignac number, because 113133022131 - 21 = 113133022129 is a prime.
It is a super-2 number, since 2×1131330221312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113133022098 and 113133022107.
It is not an unprimeable number, because it can be changed into a prime (113133022133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1937775 + ... + 1995303.
It is an arithmetic number, because the mean of its divisors is an integer number (9512988210).
Almost surely, 2113133022131 is an apocalyptic number.
113133022131 is a deficient number, since it is larger than the sum of its proper divisors (39074789229).
113133022131 is a wasteful number, since it uses less digits than its factorization.
113133022131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63446.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 113133022131 its reverse (131220331311), we get a palindrome (244353353442).
The spelling of 113133022131 in words is "one hundred thirteen billion, one hundred thirty-three million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •