Base | Representation |
---|---|
bin | 1101100001010… |
… | …00100110100001 |
3 | 21220101221201110 |
4 | 12300220212201 |
5 | 213013200023 |
6 | 15130453533 |
7 | 2544663504 |
oct | 660504641 |
9 | 256357643 |
10 | 113412513 |
11 | 59022555 |
12 | 31b942a9 |
13 | 1a65b6c6 |
14 | 110c313b |
15 | 9e53a93 |
hex | 6c289a1 |
113412513 has 4 divisors (see below), whose sum is σ = 151216688. Its totient is φ = 75608340.
The previous prime is 113412503. The next prime is 113412529. The reversal of 113412513 is 315214311.
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 not a de Polignac number, because 113412513 - 26 = 113412449 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 113412513.
It is not an unprimeable number, because it can be changed into a prime (113412503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18902083 + ... + 18902088.
It is an arithmetic number, because the mean of its divisors is an integer number (37804172).
Almost surely, 2113412513 is an apocalyptic number.
It is an amenable number.
113412513 is a deficient number, since it is larger than the sum of its proper divisors (37804175).
113412513 is an equidigital number, since it uses as much as digits as its factorization.
113412513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37804174.
The product of its digits is 360, while the sum is 21.
The square root of 113412513 is about 10649.5311164389. The cubic root of 113412513 is about 484.0463963560.
Adding to 113412513 its reverse (315214311), we get a palindrome (428626824).
The spelling of 113412513 in words is "one hundred thirteen million, four hundred twelve thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •