Base | Representation |
---|---|
bin | 11011110010110… |
… | …00000011010011 |
3 | 121020200222011122 |
4 | 31321120003103 |
5 | 434141111111 |
6 | 35045032455 |
7 | 5530460444 |
oct | 1571300323 |
9 | 536628148 |
10 | 233144531 |
11 | 10a670a34 |
12 | 660b572b |
13 | 393c0659 |
14 | 22d6d2cb |
15 | 15704cdb |
hex | de580d3 |
233144531 has 2 divisors, whose sum is σ = 233144532. Its totient is φ = 233144530.
The previous prime is 233144507. The next prime is 233144533. The reversal of 233144531 is 135441332.
233144531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 233144531 - 26 = 233144467 is a prime.
It is a super-2 number, since 2×2331445312 = 108712744670419922, which contains 22 as substring.
Together with 233144533, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 233144531.
It is not a weakly prime, because it can be changed into another prime (233144533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116572265 + 116572266.
It is an arithmetic number, because the mean of its divisors is an integer number (116572266).
Almost surely, 2233144531 is an apocalyptic number.
233144531 is a deficient number, since it is larger than the sum of its proper divisors (1).
233144531 is an equidigital number, since it uses as much as digits as its factorization.
233144531 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4320, while the sum is 26.
The square root of 233144531 is about 15269.0710588431. The cubic root of 233144531 is about 615.4721568599.
Adding to 233144531 its reverse (135441332), we get a palindrome (368585863).
The spelling of 233144531 in words is "two hundred thirty-three million, one hundred forty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •