Base | Representation |
---|---|
bin | 111111001011111011001… |
… | …001011001010110111101 |
3 | 120101002210112121120001021 |
4 | 333023323021121112331 |
5 | 1032120140402411331 |
6 | 13122425222144141 |
7 | 625465020250435 |
oct | 77137311312675 |
9 | 16332715546037 |
10 | 4342130513341 |
11 | 142453a526135 |
12 | 5a164a882051 |
13 | 2565cc1bc27a |
14 | 11023599d2c5 |
15 | 77e371e4211 |
hex | 3f2fb2595bd |
4342130513341 has 8 divisors (see below), whose sum is σ = 4434592794624. Its totient is φ = 4249671420720.
The previous prime is 4342130513251. The next prime is 4342130513351. The reversal of 4342130513341 is 1433150312434.
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 4342130513341 - 29 = 4342130512829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4342130513297 and 4342130513306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4342130513351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2063451 + ... + 3597511.
It is an arithmetic number, because the mean of its divisors is an integer number (554324099328).
Almost surely, 24342130513341 is an apocalyptic number.
It is an amenable number.
4342130513341 is a deficient number, since it is larger than the sum of its proper divisors (92462281283).
4342130513341 is a wasteful number, since it uses less digits than its factorization.
4342130513341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594331.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 4342130513341 its reverse (1433150312434), we get a palindrome (5775280825775).
The spelling of 4342130513341 in words is "four trillion, three hundred forty-two billion, one hundred thirty million, five hundred thirteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •