Base | Representation |
---|---|
bin | 10011100010000011110… |
… | …000111001100000010101 |
3 | 11202022120001011122001021 |
4 | 103202003300321200111 |
5 | 133442402022230401 |
6 | 2504341114401141 |
7 | 165654653260354 |
oct | 23420360714025 |
9 | 4668501148037 |
10 | 1342240430101 |
11 | 47827180455a |
12 | 1981757301b1 |
13 | 9975a39588c |
14 | 48d7151999b |
15 | 24dac4632a1 |
hex | 13883c39815 |
1342240430101 has 8 divisors (see below), whose sum is σ = 1358536495680. Its totient is φ = 1325947328832.
The previous prime is 1342240430099. The next prime is 1342240430107. The reversal of 1342240430101 is 1010340422431.
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 1342240430101 - 21 = 1342240430099 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 (1342240430107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 176880 + ... + 1647958.
It is an arithmetic number, because the mean of its divisors is an integer number (169817061960).
Almost surely, 21342240430101 is an apocalyptic number.
It is an amenable number.
1342240430101 is a deficient number, since it is larger than the sum of its proper divisors (16296065579).
1342240430101 is a wasteful number, since it uses less digits than its factorization.
1342240430101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1482155.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1342240430101 its reverse (1010340422431), we get a palindrome (2352580852532).
The spelling of 1342240430101 in words is "one trillion, three hundred forty-two billion, two hundred forty million, four hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •