Base | Representation |
---|---|
bin | 1101011110010… |
… | …11110001111001 |
3 | 21212200122011222 |
4 | 12233023301321 |
5 | 212414013223 |
6 | 15114401425 |
7 | 2541521162 |
oct | 657136171 |
9 | 255618158 |
10 | 113032313 |
11 | 58892939 |
12 | 31a30275 |
13 | 1a557634 |
14 | 11024769 |
15 | 9dcb0c8 |
hex | 6bcbc79 |
113032313 has 2 divisors, whose sum is σ = 113032314. Its totient is φ = 113032312.
The previous prime is 113032291. The next prime is 113032319. The reversal of 113032313 is 313230311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91623184 + 21409129 = 9572^2 + 4627^2 .
It is an emirp because it is prime and its reverse (313230311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113032313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113032291 and 113032300.
It is not a weakly prime, because it can be changed into another prime (113032319) 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, 56516156 + 56516157.
It is an arithmetic number, because the mean of its divisors is an integer number (56516157).
Almost surely, 2113032313 is an apocalyptic number.
It is an amenable number.
113032313 is a deficient number, since it is larger than the sum of its proper divisors (1).
113032313 is an equidigital number, since it uses as much as digits as its factorization.
113032313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 113032313 is about 10631.6655797669. The cubic root of 113032313 is about 483.5048909288.
Adding to 113032313 its reverse (313230311), we get a palindrome (426262624).
The spelling of 113032313 in words is "one hundred thirteen million, thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •