Base | Representation |
---|---|
bin | 10100010110011… |
… | …101111110001101 |
3 | 212210110122202002 |
4 | 110112131332031 |
5 | 1144401344003 |
6 | 53514042045 |
7 | 11314100066 |
oct | 2426357615 |
9 | 783418662 |
10 | 341434253 |
11 | 165804676 |
12 | 96419325 |
13 | 55977404 |
14 | 334bb56d |
15 | 1ee95a88 |
hex | 1459df8d |
341434253 has 2 divisors, whose sum is σ = 341434254. Its totient is φ = 341434252.
The previous prime is 341434231. The next prime is 341434259. The reversal of 341434253 is 352434143.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 326091364 + 15342889 = 18058^2 + 3917^2 .
It is an emirp because it is prime and its reverse (352434143) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 341434253 - 28 = 341433997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (341434259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 170717126 + 170717127.
It is an arithmetic number, because the mean of its divisors is an integer number (170717127).
Almost surely, 2341434253 is an apocalyptic number.
It is an amenable number.
341434253 is a deficient number, since it is larger than the sum of its proper divisors (1).
341434253 is an equidigital number, since it uses as much as digits as its factorization.
341434253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17280, while the sum is 29.
The square root of 341434253 is about 18477.9396308138. The cubic root of 341434253 is about 698.9332411344.
Adding to 341434253 its reverse (352434143), we get a palindrome (693868396).
The spelling of 341434253 in words is "three hundred forty-one million, four hundred thirty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •