Base | Representation |
---|---|
bin | 11011110001101… |
… | …11111110001101 |
3 | 121020110021221001 |
4 | 31320313332031 |
5 | 434122410013 |
6 | 35042140301 |
7 | 5526402403 |
oct | 1570677615 |
9 | 536407831 |
10 | 233013133 |
11 | 10a591241 |
12 | 66051691 |
13 | 393758c2 |
14 | 22d37473 |
15 | 156caddd |
hex | de37f8d |
233013133 has 2 divisors, whose sum is σ = 233013134. Its totient is φ = 233013132.
The previous prime is 233013103. The next prime is 233013139. The reversal of 233013133 is 331310332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 221027689 + 11985444 = 14867^2 + 3462^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-233013133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 233013133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (233013139) 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, 116506566 + 116506567.
It is an arithmetic number, because the mean of its divisors is an integer number (116506567).
Almost surely, 2233013133 is an apocalyptic number.
It is an amenable number.
233013133 is a deficient number, since it is larger than the sum of its proper divisors (1).
233013133 is an equidigital number, since it uses as much as digits as its factorization.
233013133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 19.
The square root of 233013133 is about 15264.7677021303. The cubic root of 233013133 is about 615.3565104156.
Adding to 233013133 its reverse (331310332), we get a palindrome (564323465).
The spelling of 233013133 in words is "two hundred thirty-three million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •