Base | Representation |
---|---|
bin | 110100101011100110… |
… | …0010101100000011111 |
3 | 101211000100211010110122 |
4 | 1221113030111200133 |
5 | 3323143243020221 |
6 | 123545551225155 |
7 | 11113342100420 |
oct | 1512714254037 |
9 | 354010733418 |
10 | 113132001311 |
11 | 43a8507a04a |
12 | 19b138181bb |
13 | a88c34ab14 |
14 | 569314b647 |
15 | 2e22062eab |
hex | 1a5731581f |
113132001311 has 8 divisors (see below), whose sum is σ = 131223473280. Its totient is φ = 95522968728.
The previous prime is 113132001263. The next prime is 113132001331. The reversal of 113132001311 is 113100231311.
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 113132001311 - 234 = 95952132127 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113132001311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113132001331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120609341 + ... + 120610278.
It is an arithmetic number, because the mean of its divisors is an integer number (16402934160).
Almost surely, 2113132001311 is an apocalyptic number.
113132001311 is a deficient number, since it is larger than the sum of its proper divisors (18091471969).
113132001311 is an equidigital number, since it uses as much as digits as its factorization.
113132001311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241219693.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 113132001311 its reverse (113100231311), we get a palindrome (226232232622).
The spelling of 113132001311 in words is "one hundred thirteen billion, one hundred thirty-two million, one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •