Base | Representation |
---|---|
bin | 10100110000000… |
… | …011100111011001 |
3 | 220021002110002200 |
4 | 110300003213121 |
5 | 1203111021131 |
6 | 54313520413 |
7 | 11425105242 |
oct | 2460034731 |
9 | 807073080 |
10 | 348142041 |
11 | 1695762a5 |
12 | 98713109 |
13 | 57185610 |
14 | 34345cc9 |
15 | 2086d2e6 |
hex | 14c039d9 |
348142041 has 24 divisors (see below), whose sum is σ = 545475840. Its totient is φ = 212690016.
The previous prime is 348142033. The next prime is 348142049. The reversal of 348142041 is 140241843.
It is an interprime number because it is at equal distance from previous prime (348142033) and next prime (348142049).
It is not a de Polignac number, because 348142041 - 23 = 348142033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 348141996 and 348142014.
It is not an unprimeable number, because it can be changed into a prime (348142049) 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 23 ways as a sum of consecutive naturals, for example, 5560 + ... + 26966.
It is an arithmetic number, because the mean of its divisors is an integer number (22728160).
Almost surely, 2348142041 is an apocalyptic number.
It is an amenable number.
348142041 is a deficient number, since it is larger than the sum of its proper divisors (197333799).
348142041 is a wasteful number, since it uses less digits than its factorization.
348142041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21565 (or 21562 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The square root of 348142041 is about 18658.5648161910. The cubic root of 348142041 is about 703.4806513410.
Adding to 348142041 its reverse (140241843), we get a palindrome (488383884).
The spelling of 348142041 in words is "three hundred forty-eight million, one hundred forty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •