Base | Representation |
---|---|
bin | 110100110000111011… |
… | …1100101111110101101 |
3 | 101211110211211221200211 |
4 | 1221201313211332231 |
5 | 3324030121110013 |
6 | 124015430222421 |
7 | 11120645366341 |
oct | 1514167457655 |
9 | 354424757624 |
10 | 113311113133 |
11 | 44067195449 |
12 | 19b637b4a11 |
13 | a8ba4a064a |
14 | 56acc53621 |
15 | 2e32b4323d |
hex | 1a61de5fad |
113311113133 has 4 divisors (see below), whose sum is σ = 113323752928. Its totient is φ = 113298473340.
The previous prime is 113311113101. The next prime is 113311113163. The reversal of 113311113133 is 331311113311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 113311113133 - 25 = 113311113101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113311113163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6306441 + ... + 6324382.
It is an arithmetic number, because the mean of its divisors is an integer number (28330938232).
Almost surely, 2113311113133 is an apocalyptic number.
It is an amenable number.
113311113133 is a deficient number, since it is larger than the sum of its proper divisors (12639795).
113311113133 is an equidigital number, since it uses as much as digits as its factorization.
113311113133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12639794.
The product of its digits is 243, while the sum is 22.
Adding to 113311113133 its reverse (331311113311), we get a palindrome (444622226444).
The spelling of 113311113133 in words is "one hundred thirteen billion, three hundred eleven million, one hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •