Base | Representation |
---|---|
bin | 1101100001011… |
… | …01111111101001 |
3 | 21220110002000112 |
4 | 12300231333221 |
5 | 213014401401 |
6 | 15131144105 |
7 | 2545115060 |
oct | 660557751 |
9 | 256402015 |
10 | 113434601 |
11 | 59038105 |
12 | 31ba5035 |
13 | 1a668787 |
14 | 110cb1d7 |
15 | 9e5a3bb |
hex | 6c2dfe9 |
113434601 has 4 divisors (see below), whose sum is σ = 129639552. Its totient is φ = 97229652.
The previous prime is 113434567. The next prime is 113434609. The reversal of 113434601 is 106434311.
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, and also an emirpimes, since its reverse is a distinct semiprime: 106434311 = 37 ⋅2876603.
It is a cyclic number.
It is not a de Polignac number, because 113434601 - 218 = 113172457 is a prime.
It is not an unprimeable number, because it can be changed into a prime (113434609) 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, 8102465 + ... + 8102478.
It is an arithmetic number, because the mean of its divisors is an integer number (32409888).
Almost surely, 2113434601 is an apocalyptic number.
It is an amenable number.
113434601 is a deficient number, since it is larger than the sum of its proper divisors (16204951).
113434601 is an equidigital number, since it uses as much as digits as its factorization.
113434601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16204950.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 113434601 is about 10650.5681069134. The cubic root of 113434601 is about 484.0778182938.
Adding to 113434601 its reverse (106434311), we get a palindrome (219868912).
The spelling of 113434601 in words is "one hundred thirteen million, four hundred thirty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •