Base | Representation |
---|---|
bin | 1001011001111110111101… |
… | …1000011010000001011101 |
3 | 1100121200111221011000022102 |
4 | 2112133233120122001131 |
5 | 2323420410110343031 |
6 | 33555014512054445 |
7 | 2115120314151110 |
oct | 226375730320135 |
9 | 40550457130272 |
10 | 10342002434141 |
11 | 3328022838804 |
12 | 11b0423834425 |
13 | 5a0328b56951 |
14 | 27a7ac76c577 |
15 | 12e044ccc7cb |
hex | 967ef61a05d |
10342002434141 has 4 divisors (see below), whose sum is σ = 11819431353312. Its totient is φ = 8864573514972.
The previous prime is 10342002434129. The next prime is 10342002434189. The reversal of 10342002434141 is 14143420024301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-10342002434141 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 (10342002434111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 738714459575 + ... + 738714459588.
It is an arithmetic number, because the mean of its divisors is an integer number (2954857838328).
Almost surely, 210342002434141 is an apocalyptic number.
It is an amenable number.
10342002434141 is a deficient number, since it is larger than the sum of its proper divisors (1477428919171).
10342002434141 is an equidigital number, since it uses as much as digits as its factorization.
10342002434141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1477428919170.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 10342002434141 its reverse (14143420024301), we get a palindrome (24485422458442).
The spelling of 10342002434141 in words is "ten trillion, three hundred forty-two billion, two million, four hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •