Base | Representation |
---|---|
bin | 10100011011001… |
… | …000100001100001 |
3 | 212212202210012111 |
4 | 110123020201201 |
5 | 1200210011441 |
6 | 54000155321 |
7 | 11330352232 |
oct | 2433104141 |
9 | 785683174 |
10 | 342657121 |
11 | 16646a404 |
12 | 96908b41 |
13 | 55cb4bc1 |
14 | 33719089 |
15 | 20138081 |
hex | 146c8861 |
342657121 has 9 divisors (see below), whose sum is σ = 347900371. Its totient is φ = 337492552.
The previous prime is 342657103. The next prime is 342657143. The reversal of 342657121 is 121756243.
The square root of 342657121 is 18511.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 311699025 + 30958096 = 17655^2 + 5564^2 .
It is a de Polignac number, because none of the positive numbers 2k-342657121 is a prime.
It is a Duffinian number.
Its product of digits (10080) is a multiple of the sum of its prime divisors (280).
It is not an unprimeable number, because it can be changed into a prime (342657221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1980591 + ... + 1980763.
Almost surely, 2342657121 is an apocalyptic number.
342657121 is the 18511-st square number.
342657121 is the 9256-th centered octagonal number.
It is an amenable number.
342657121 is a deficient number, since it is larger than the sum of its proper divisors (5243250).
342657121 is an frugal number, since it uses more digits than its factorization.
342657121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560 (or 280 counting only the distinct ones).
The product of its digits is 10080, while the sum is 31.
The cubic root of 342657121 is about 699.7666712135.
The spelling of 342657121 in words is "three hundred forty-two million, six hundred fifty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •