Base | Representation |
---|---|
bin | 1101011111111… |
… | …01010111101001 |
3 | 21220001221210221 |
4 | 12233331113221 |
5 | 212442013213 |
6 | 15123010041 |
7 | 2543325313 |
oct | 657752751 |
9 | 256057727 |
10 | 113235433 |
11 | 58a11503 |
12 | 31b09921 |
13 | 1a5c8c1c |
14 | 110787b3 |
15 | 9e1b38d |
hex | 6bfd5e9 |
113235433 has 2 divisors, whose sum is σ = 113235434. Its totient is φ = 113235432.
The previous prime is 113235407. The next prime is 113235449. The reversal of 113235433 is 334532311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108430569 + 4804864 = 10413^2 + 2192^2 .
It is an emirp because it is prime and its reverse (334532311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113235433 - 225 = 79681001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113235398 and 113235407.
It is not a weakly prime, because it can be changed into another prime (113235533) 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, 56617716 + 56617717.
It is an arithmetic number, because the mean of its divisors is an integer number (56617717).
Almost surely, 2113235433 is an apocalyptic number.
It is an amenable number.
113235433 is a deficient number, since it is larger than the sum of its proper divisors (1).
113235433 is an equidigital number, since it uses as much as digits as its factorization.
113235433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3240, while the sum is 25.
The square root of 113235433 is about 10641.2138875224. The cubic root of 113235433 is about 483.7943383789.
Adding to 113235433 its reverse (334532311), we get a palindrome (447767744).
The spelling of 113235433 in words is "one hundred thirteen million, two hundred thirty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •