Base | Representation |
---|---|
bin | 11011101010111… |
… | …01111110110001 |
3 | 121011202221002222 |
4 | 31311131332301 |
5 | 433410321431 |
6 | 35011050425 |
7 | 5515663253 |
oct | 1565357661 |
9 | 534687088 |
10 | 232120241 |
11 | 10a031411 |
12 | 658a0a15 |
13 | 39122372 |
14 | 22b83cd3 |
15 | 155a157b |
hex | dd5dfb1 |
232120241 has 2 divisors, whose sum is σ = 232120242. Its totient is φ = 232120240.
The previous prime is 232120223. The next prime is 232120243. The reversal of 232120241 is 142021232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 170041600 + 62078641 = 13040^2 + 7879^2 .
It is a cyclic number.
It is not a de Polignac number, because 232120241 - 26 = 232120177 is a prime.
Together with 232120243, 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 (232120243) 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, 116060120 + 116060121.
It is an arithmetic number, because the mean of its divisors is an integer number (116060121).
Almost surely, 2232120241 is an apocalyptic number.
It is an amenable number.
232120241 is a deficient number, since it is larger than the sum of its proper divisors (1).
232120241 is an equidigital number, since it uses as much as digits as its factorization.
232120241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 232120241 is about 15235.4928046322. The cubic root of 232120241 is about 614.5695015294.
Adding to 232120241 its reverse (142021232), we get a palindrome (374141473).
Subtracting from 232120241 its reverse (142021232), we obtain a palindrome (90099009).
The spelling of 232120241 in words is "two hundred thirty-two million, one hundred twenty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •