Base | Representation |
---|---|
bin | 1110000010111111111… |
… | …1000100111111010001 |
3 | 212001220020020102202011 |
4 | 3200233333010333101 |
5 | 12423212221430413 |
6 | 302510134222521 |
7 | 23302133431435 |
oct | 3405777047721 |
9 | 761806212664 |
10 | 241323233233 |
11 | 93387745a25 |
12 | 3a92a7b4a41 |
13 | 199ab582684 |
14 | b9742da9c5 |
15 | 64261da33d |
hex | 382ffc4fd1 |
241323233233 has 2 divisors, whose sum is σ = 241323233234. Its totient is φ = 241323233232.
The previous prime is 241323233213. The next prime is 241323233251. The reversal of 241323233233 is 332332323142.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 239675847489 + 1647385744 = 489567^2 + 40588^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-241323233233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 241323233195 and 241323233204.
It is not a weakly prime, because it can be changed into another prime (241323233213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120661616616 + 120661616617.
It is an arithmetic number, because the mean of its divisors is an integer number (120661616617).
Almost surely, 2241323233233 is an apocalyptic number.
It is an amenable number.
241323233233 is a deficient number, since it is larger than the sum of its proper divisors (1).
241323233233 is an equidigital number, since it uses as much as digits as its factorization.
241323233233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46656, while the sum is 31.
Adding to 241323233233 its reverse (332332323142), we get a palindrome (573655556375).
The spelling of 241323233233 in words is "two hundred forty-one billion, three hundred twenty-three million, two hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •