Base | Representation |
---|---|
bin | 1101100010011… |
… | …01000001010001 |
3 | 21220200112100012 |
4 | 12301031001101 |
5 | 213032433211 |
6 | 15134004305 |
7 | 2546154422 |
oct | 661150121 |
9 | 256615305 |
10 | 113561681 |
11 | 59114632 |
12 | 32046695 |
13 | 1a6b157c |
14 | 11121649 |
15 | 9e82d8b |
hex | 6c4d051 |
113561681 has 2 divisors, whose sum is σ = 113561682. Its totient is φ = 113561680.
The previous prime is 113561659. The next prime is 113561699. The reversal of 113561681 is 186165311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112169281 + 1392400 = 10591^2 + 1180^2 .
It is an emirp because it is prime and its reverse (186165311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113561681 is a prime.
It is a super-2 number, since 2×1135616812 = 25792510783091522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (113561641) 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, 56780840 + 56780841.
It is an arithmetic number, because the mean of its divisors is an integer number (56780841).
Almost surely, 2113561681 is an apocalyptic number.
It is an amenable number.
113561681 is a deficient number, since it is larger than the sum of its proper divisors (1).
113561681 is an equidigital number, since it uses as much as digits as its factorization.
113561681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4320, while the sum is 32.
The square root of 113561681 is about 10656.5323159084. The cubic root of 113561681 is about 484.2585205095.
The spelling of 113561681 in words is "one hundred thirteen million, five hundred sixty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •