Base | Representation |
---|---|
bin | 1101011111101… |
… | …11010000111111 |
3 | 21220000200111221 |
4 | 12233313100333 |
5 | 212440213211 |
6 | 15122254211 |
7 | 2543162365 |
oct | 657672077 |
9 | 256020457 |
10 | 113210431 |
11 | 589a4744 |
12 | 31ab7367 |
13 | 1a5ba729 |
14 | 1106d635 |
15 | 9e13c71 |
hex | 6bf743f |
113210431 has 2 divisors, whose sum is σ = 113210432. Its totient is φ = 113210430.
The previous prime is 113210413. The next prime is 113210453. The reversal of 113210431 is 134012311.
Together with previous prime (113210413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (134012311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113210431 - 25 = 113210399 is a prime.
It is a super-2 number, since 2×1132104312 = 25633203374411522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113210231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56605215 + 56605216.
It is an arithmetic number, because the mean of its divisors is an integer number (56605216).
Almost surely, 2113210431 is an apocalyptic number.
113210431 is a deficient number, since it is larger than the sum of its proper divisors (1).
113210431 is an equidigital number, since it uses as much as digits as its factorization.
113210431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 113210431 is about 10640.0390506802. The cubic root of 113210431 is about 483.7587290410.
Adding to 113210431 its reverse (134012311), we get a palindrome (247222742).
The spelling of 113210431 in words is "one hundred thirteen million, two hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •