Base | Representation |
---|---|
bin | 1101100000011… |
… | …01110100011101 |
3 | 21220012101020111 |
4 | 12300031310131 |
5 | 213001142223 |
6 | 15124250021 |
7 | 2544025621 |
oct | 660156435 |
9 | 256171214 |
10 | 113302813 |
11 | 58a58098 |
12 | 31b40911 |
13 | 1a6207b0 |
14 | 11095181 |
15 | 9e3130d |
hex | 6c0dd1d |
113302813 has 4 divisors (see below), whose sum is σ = 122018428. Its totient is φ = 104587200.
The previous prime is 113302811. The next prime is 113302823. The reversal of 113302813 is 318203311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 318203311 = 43 ⋅7400077.
It can be written as a sum of positive squares in 2 ways, for example, as 53904964 + 59397849 = 7342^2 + 7707^2 .
It is a cyclic number.
It is not a de Polignac number, because 113302813 - 21 = 113302811 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113302811) 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, 4357788 + ... + 4357813.
It is an arithmetic number, because the mean of its divisors is an integer number (30504607).
Almost surely, 2113302813 is an apocalyptic number.
113302813 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
113302813 is a deficient number, since it is larger than the sum of its proper divisors (8715615).
113302813 is an equidigital number, since it uses as much as digits as its factorization.
113302813 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8715614.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 113302813 is about 10644.3794088711. The cubic root of 113302813 is about 483.8902788987.
The spelling of 113302813 in words is "one hundred thirteen million, three hundred two thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •