Base | Representation |
---|---|
bin | 1101011111111… |
… | …11100001001001 |
3 | 21220002101212212 |
4 | 12233333201021 |
5 | 212442303413 |
6 | 15123114505 |
7 | 2543363054 |
oct | 657774111 |
9 | 256071785 |
10 | 113244233 |
11 | 58a18083 |
12 | 31b12a35 |
13 | 1a5ccc2b |
14 | 1107ba9b |
15 | 9e1dca8 |
hex | 6bff849 |
113244233 has 2 divisors, whose sum is σ = 113244234. Its totient is φ = 113244232.
The previous prime is 113244221. The next prime is 113244239. The reversal of 113244233 is 332442311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112105744 + 1138489 = 10588^2 + 1067^2 .
It is an emirp because it is prime and its reverse (332442311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113244233 - 26 = 113244169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113244199 and 113244208.
It is not a weakly prime, because it can be changed into another prime (113244239) 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, 56622116 + 56622117.
It is an arithmetic number, because the mean of its divisors is an integer number (56622117).
Almost surely, 2113244233 is an apocalyptic number.
It is an amenable number.
113244233 is a deficient number, since it is larger than the sum of its proper divisors (1).
113244233 is an equidigital number, since it uses as much as digits as its factorization.
113244233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728, while the sum is 23.
The square root of 113244233 is about 10641.6273661503. The cubic root of 113244233 is about 483.8068706161.
Adding to 113244233 its reverse (332442311), we get a palindrome (445686544).
The spelling of 113244233 in words is "one hundred thirteen million, two hundred forty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •