Base | Representation |
---|---|
bin | 1101100001000… |
… | …00101001100101 |
3 | 21220100022001002 |
4 | 12300200221211 |
5 | 213011124231 |
6 | 15130043045 |
7 | 2544466523 |
oct | 660405145 |
9 | 256308032 |
10 | 113379941 |
11 | 59000034 |
12 | 31b79485 |
13 | 1a64992c |
14 | 110b5313 |
15 | 9e490cb |
hex | 6c20a65 |
113379941 has 2 divisors, whose sum is σ = 113379942. Its totient is φ = 113379940.
The previous prime is 113379901. The next prime is 113379977. The reversal of 113379941 is 149973311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71402500 + 41977441 = 8450^2 + 6479^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113379941 is a prime.
It is a super-2 number, since 2×1133799412 = 25710022042326962, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113379895 and 113379904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113379901) 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 as a sum of consecutive naturals, namely, 56689970 + 56689971.
It is an arithmetic number, because the mean of its divisors is an integer number (56689971).
Almost surely, 2113379941 is an apocalyptic number.
It is an amenable number.
113379941 is a deficient number, since it is larger than the sum of its proper divisors (1).
113379941 is an equidigital number, since it uses as much as digits as its factorization.
113379941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20412, while the sum is 38.
The square root of 113379941 is about 10648.0017374153. The cubic root of 113379941 is about 484.0000526489. Note that the first 4 decimals are identical.
The spelling of 113379941 in words is "one hundred thirteen million, three hundred seventy-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •