Base | Representation |
---|---|
bin | 1101011110011… |
… | …10011110110001 |
3 | 21212201012100202 |
4 | 12233032132301 |
5 | 212414342002 |
6 | 15114524545 |
7 | 2541565346 |
oct | 657163661 |
9 | 255635322 |
10 | 113043377 |
11 | 588a0187 |
12 | 31a36755 |
13 | 1a55c695 |
14 | 110287cd |
15 | 9dce502 |
hex | 6bce7b1 |
113043377 has 2 divisors, whose sum is σ = 113043378. Its totient is φ = 113043376.
The previous prime is 113043373. The next prime is 113043379. The reversal of 113043377 is 773340311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103408561 + 9634816 = 10169^2 + 3104^2 .
It is a cyclic number.
It is not a de Polignac number, because 113043377 - 22 = 113043373 is a prime.
It is a super-3 number, since 3×1130433773 (a number of 25 digits) contains 333 as substring.
Together with 113043379, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (113043373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56521688 + 56521689.
It is an arithmetic number, because the mean of its divisors is an integer number (56521689).
Almost surely, 2113043377 is an apocalyptic number.
It is an amenable number.
113043377 is a deficient number, since it is larger than the sum of its proper divisors (1).
113043377 is an equidigital number, since it uses as much as digits as its factorization.
113043377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 29.
The square root of 113043377 is about 10632.1858994282. The cubic root of 113043377 is about 483.5206661334.
Adding to 113043377 its reverse (773340311), we get a palindrome (886383688).
The spelling of 113043377 in words is "one hundred thirteen million, forty-three thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •