Base | Representation |
---|---|
bin | 110100101110100101… |
… | …0101100001001001001 |
3 | 101211021100102102112122 |
4 | 1221131022230021021 |
5 | 3323344422424113 |
6 | 124003531421025 |
7 | 11116000046243 |
oct | 1513512541111 |
9 | 354240372478 |
10 | 113232233033 |
11 | 44026709687 |
12 | 19b412b4775 |
13 | a8a7042c2a |
14 | 56a259d093 |
15 | 2e2ac61408 |
hex | 1a5d2ac249 |
113232233033 has 2 divisors, whose sum is σ = 113232233034. Its totient is φ = 113232233032.
The previous prime is 113232232999. The next prime is 113232233063. The reversal of 113232233033 is 330332232311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67328313529 + 45903919504 = 259477^2 + 214252^2 .
It is a cyclic number.
It is not a de Polignac number, because 113232233033 - 232 = 108937265737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113232232993 and 113232233011.
It is not a weakly prime, because it can be changed into another prime (113232233063) 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, 56616116516 + 56616116517.
It is an arithmetic number, because the mean of its divisors is an integer number (56616116517).
Almost surely, 2113232233033 is an apocalyptic number.
It is an amenable number.
113232233033 is a deficient number, since it is larger than the sum of its proper divisors (1).
113232233033 is an equidigital number, since it uses as much as digits as its factorization.
113232233033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 113232233033 its reverse (330332232311), we get a palindrome (443564465344).
The spelling of 113232233033 in words is "one hundred thirteen billion, two hundred thirty-two million, two hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •