Base | Representation |
---|---|
bin | 10100010101010… |
… | …010110010110001 |
3 | 212202220000100012 |
4 | 110111102302301 |
5 | 1144312020241 |
6 | 53503304305 |
7 | 11311345244 |
oct | 2425226261 |
9 | 782800305 |
10 | 341126321 |
11 | 165614288 |
12 | 962ab095 |
13 | 5589a1c3 |
14 | 3343b25b |
15 | 1ee346eb |
hex | 14552cb1 |
341126321 has 8 divisors (see below), whose sum is σ = 344658024. Its totient is φ = 337603840.
The previous prime is 341126309. The next prime is 341126339. The reversal of 341126321 is 123621143.
It can be written as a sum of positive squares in 4 ways, for example, as 4000000 + 337126321 = 2000^2 + 18361^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 341126321 - 26 = 341126257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (341126341) 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 in 7 ways as a sum of consecutive naturals, for example, 90935 + ... + 94611.
It is an arithmetic number, because the mean of its divisors is an integer number (43082253).
Almost surely, 2341126321 is an apocalyptic number.
It is an amenable number.
341126321 is a deficient number, since it is larger than the sum of its proper divisors (3531703).
341126321 is a wasteful number, since it uses less digits than its factorization.
341126321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4611.
The product of its digits is 864, while the sum is 23.
The square root of 341126321 is about 18469.6053287557. The cubic root of 341126321 is about 698.7230604595.
Adding to 341126321 its reverse (123621143), we get a palindrome (464747464).
The spelling of 341126321 in words is "three hundred forty-one million, one hundred twenty-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •