Base | Representation |
---|---|
bin | 1101100001110… |
… | …00101011000101 |
3 | 21220112022000112 |
4 | 12300320223011 |
5 | 213022301331 |
6 | 15132122405 |
7 | 2545356434 |
oct | 660705305 |
9 | 256468015 |
10 | 113478341 |
11 | 59067a59 |
12 | 32006405 |
13 | 1a682662 |
14 | 110dd11b |
15 | 9e6832b |
hex | 6c38ac5 |
113478341 has 2 divisors, whose sum is σ = 113478342. Its totient is φ = 113478340.
The previous prime is 113478311. The next prime is 113478359. The reversal of 113478341 is 143874311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103530625 + 9947716 = 10175^2 + 3154^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113478341 is a prime.
It is a super-2 number, since 2×1134783412 = 25754667752224562, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113478298 and 113478307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113478311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56739170 + 56739171.
It is an arithmetic number, because the mean of its divisors is an integer number (56739171).
Almost surely, 2113478341 is an apocalyptic number.
It is an amenable number.
113478341 is a deficient number, since it is larger than the sum of its proper divisors (1).
113478341 is an equidigital number, since it uses as much as digits as its factorization.
113478341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8064, while the sum is 32.
The square root of 113478341 is about 10652.6213205952. The cubic root of 113478341 is about 484.1400298902.
The spelling of 113478341 in words is "one hundred thirteen million, four hundred seventy-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •