Base | Representation |
---|---|
bin | 1101011111001… |
… | …00001101111011 |
3 | 21212212201111022 |
4 | 12233210031323 |
5 | 212430214121 |
6 | 15120453055 |
7 | 2542416050 |
oct | 657441573 |
9 | 255781438 |
10 | 113132411 |
11 | 58951067 |
12 | 31a7a18b |
13 | 1a591072 |
14 | 1104d027 |
15 | 9deaaab |
hex | 6be437b |
113132411 has 4 divisors (see below), whose sum is σ = 129294192. Its totient is φ = 96970632.
The previous prime is 113132401. The next prime is 113132413. The reversal of 113132411 is 114231311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 114231311 = 31 ⋅3684881.
It is a cyclic number.
It is not a de Polignac number, because 113132411 - 214 = 113116027 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 113132411.
It is not an unprimeable number, because it can be changed into a prime (113132413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8080880 + ... + 8080893.
It is an arithmetic number, because the mean of its divisors is an integer number (32323548).
Almost surely, 2113132411 is an apocalyptic number.
113132411 is a deficient number, since it is larger than the sum of its proper divisors (16161781).
113132411 is an equidigital number, since it uses as much as digits as its factorization.
113132411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16161780.
The product of its digits is 72, while the sum is 17.
The square root of 113132411 is about 10636.3720788622. The cubic root of 113132411 is about 483.6475745908.
Adding to 113132411 its reverse (114231311), we get a palindrome (227363722).
The spelling of 113132411 in words is "one hundred thirteen million, one hundred thirty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •