Base | Representation |
---|---|
bin | 11011110011010… |
… | …00111000000001 |
3 | 121020211110200212 |
4 | 31321220320001 |
5 | 434200312231 |
6 | 35050323505 |
7 | 5531165366 |
oct | 1571507001 |
9 | 536743625 |
10 | 233213441 |
11 | 10a70878a |
12 | 66129595 |
13 | 39415b26 |
14 | 22d8a46d |
15 | 1571a42b |
hex | de68e01 |
233213441 has 2 divisors, whose sum is σ = 233213442. Its totient is φ = 233213440.
The previous prime is 233213437. The next prime is 233213443. The reversal of 233213441 is 144312332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 233203441 + 10000 = 15271^2 + 100^2 .
It is a cyclic number.
It is not a de Polignac number, because 233213441 - 22 = 233213437 is a prime.
Together with 233213443, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (233213443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116606720 + 116606721.
It is an arithmetic number, because the mean of its divisors is an integer number (116606721).
Almost surely, 2233213441 is an apocalyptic number.
It is an amenable number.
233213441 is a deficient number, since it is larger than the sum of its proper divisors (1).
233213441 is an equidigital number, since it uses as much as digits as its factorization.
233213441 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 233213441 is about 15271.3274144719. The cubic root of 233213441 is about 615.5327887896.
Adding to 233213441 its reverse (144312332), we get a palindrome (377525773).
It can be divided in two parts, 23321 and 3441, that added together give a palindrome (26762).
The spelling of 233213441 in words is "two hundred thirty-three million, two hundred thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •