Base | Representation |
---|---|
bin | 1101100001001… |
… | …11000010100001 |
3 | 21220101121221102 |
4 | 12300213002201 |
5 | 213012443423 |
6 | 15130404145 |
7 | 2544636032 |
oct | 660470241 |
9 | 256347842 |
10 | 113406113 |
11 | 59018767 |
12 | 31b90655 |
13 | 1a658812 |
14 | 110c0a89 |
15 | 9e51c28 |
hex | 6c270a1 |
113406113 has 4 divisors (see below), whose sum is σ = 113450628. Its totient is φ = 113361600.
The previous prime is 113406103. The next prime is 113406119. The reversal of 113406113 is 311604311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 311604311 = 59 ⋅5281429.
It can be written as a sum of positive squares in 2 ways, for example, as 53699584 + 59706529 = 7328^2 + 7727^2 .
It is a cyclic number.
It is not a de Polignac number, because 113406113 - 26 = 113406049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113406119) 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, 18188 + ... + 23613.
It is an arithmetic number, because the mean of its divisors is an integer number (28362657).
Almost surely, 2113406113 is an apocalyptic number.
It is an amenable number.
113406113 is a deficient number, since it is larger than the sum of its proper divisors (44515).
113406113 is an equidigital number, since it uses as much as digits as its factorization.
113406113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44514.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 113406113 is about 10649.2306294868. The cubic root of 113406113 is about 484.0372910843.
The spelling of 113406113 in words is "one hundred thirteen million, four hundred six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •