Base | Representation |
---|---|
bin | 10100011110000… |
… | …101110000110001 |
3 | 212221020011110122 |
4 | 110132011300301 |
5 | 1200404312431 |
6 | 54024540025 |
7 | 11340061115 |
oct | 2436056061 |
9 | 787204418 |
10 | 343432241 |
11 | 1669497a9 |
12 | 97021615 |
13 | 561c6959 |
14 | 3387b745 |
15 | 2023ca7b |
hex | 14785c31 |
343432241 has 2 divisors, whose sum is σ = 343432242. Its totient is φ = 343432240.
The previous prime is 343432231. The next prime is 343432253. The reversal of 343432241 is 142234343.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 273207841 + 70224400 = 16529^2 + 8380^2 .
It is a cyclic number.
It is not a de Polignac number, because 343432241 - 222 = 339237937 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 343432241.
It is not a weakly prime, because it can be changed into another prime (343432211) 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, 171716120 + 171716121.
It is an arithmetic number, because the mean of its divisors is an integer number (171716121).
Almost surely, 2343432241 is an apocalyptic number.
It is an amenable number.
343432241 is a deficient number, since it is larger than the sum of its proper divisors (1).
343432241 is an equidigital number, since it uses as much as digits as its factorization.
343432241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 26.
The square root of 343432241 is about 18531.9249135107. The cubic root of 343432241 is about 700.2939180681.
Adding to 343432241 its reverse (142234343), we get a palindrome (485666584).
The spelling of 343432241 in words is "three hundred forty-three million, four hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •