Base | Representation |
---|---|
bin | 110100101011100110… |
… | …0010111101010010101 |
3 | 101211000100211120120101 |
4 | 1221113030113222111 |
5 | 3323143243311013 |
6 | 123545551334101 |
7 | 11113342135222 |
oct | 1512714275225 |
9 | 354010746511 |
10 | 113132010133 |
11 | 43a8508573a |
12 | 19b13821331 |
13 | a88c351b3c |
14 | 5693150949 |
15 | 2e220658dd |
hex | 1a57317a95 |
113132010133 has 4 divisors (see below), whose sum is σ = 113192220640. Its totient is φ = 113071799628.
The previous prime is 113132010107. The next prime is 113132010139. The reversal of 113132010133 is 331010231311.
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 113132010133 - 221 = 113129912981 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 113132010133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113132010139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30102435 + ... + 30106192.
It is an arithmetic number, because the mean of its divisors is an integer number (28298055160).
Almost surely, 2113132010133 is an apocalyptic number.
It is an amenable number.
113132010133 is a deficient number, since it is larger than the sum of its proper divisors (60210507).
113132010133 is an equidigital number, since it uses as much as digits as its factorization.
113132010133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60210506.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 113132010133 its reverse (331010231311), we get a palindrome (444142241444).
The spelling of 113132010133 in words is "one hundred thirteen billion, one hundred thirty-two million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •