Base | Representation |
---|---|
bin | 10100101000110… |
… | …011010010001101 |
3 | 220010111211011221 |
4 | 110220303102031 |
5 | 1202114141031 |
6 | 54205043341 |
7 | 11402664322 |
oct | 2450632215 |
9 | 803454157 |
10 | 346240141 |
11 | 168497385 |
12 | 97b56551 |
13 | 5696aa30 |
14 | 33dacb49 |
15 | 205e4a11 |
hex | 14a3348d |
346240141 has 8 divisors (see below), whose sum is σ = 373434264. Its totient is φ = 319126080.
The previous prime is 346240133. The next prime is 346240157. The reversal of 346240141 is 141042643.
It can be written as a sum of positive squares in 4 ways, for example, as 23319241 + 322920900 = 4829^2 + 17970^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 346240141 - 23 = 346240133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (346240841) 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, 10870 + ... + 28471.
It is an arithmetic number, because the mean of its divisors is an integer number (46679283).
Almost surely, 2346240141 is an apocalyptic number.
It is an amenable number.
346240141 is a deficient number, since it is larger than the sum of its proper divisors (27194123).
346240141 is a wasteful number, since it uses less digits than its factorization.
346240141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40031.
The product of its (nonzero) digits is 2304, while the sum is 25.
The square root of 346240141 is about 18607.5291481701. The cubic root of 346240141 is about 702.1972731781.
Adding to 346240141 its reverse (141042643), we get a palindrome (487282784).
The spelling of 346240141 in words is "three hundred forty-six million, two hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •