Base | Representation |
---|---|
bin | 10011100001111101110… |
… | …010101010110110111101 |
3 | 11202022022001121222212012 |
4 | 103201331302222312331 |
5 | 133442200344343401 |
6 | 2504323135021005 |
7 | 165652325506115 |
oct | 23417562526675 |
9 | 4668261558765 |
10 | 1342140231101 |
11 | 47822019756a |
12 | 19814806a765 |
13 | 997426b2627 |
14 | 48d620b6045 |
15 | 24da376e8bb |
hex | 1387dcaadbd |
1342140231101 has 8 divisors (see below), whose sum is σ = 1343444992344. Its totient is φ = 1340835612480.
The previous prime is 1342140231083. The next prime is 1342140231161. The reversal of 1342140231101 is 1011320412431.
It can be written as a sum of positive squares in 4 ways, for example, as 399551674201 + 942588556900 = 632101^2 + 970870^2 .
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 1342140231101 - 218 = 1342139968957 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 (1342140231161) 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, 35985875 + ... + 36023151.
It is an arithmetic number, because the mean of its divisors is an integer number (167930624043).
Almost surely, 21342140231101 is an apocalyptic number.
It is an amenable number.
1342140231101 is a deficient number, since it is larger than the sum of its proper divisors (1304761243).
1342140231101 is a wasteful number, since it uses less digits than its factorization.
1342140231101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71311.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1342140231101 its reverse (1011320412431), we get a palindrome (2353460643532).
The spelling of 1342140231101 in words is "one trillion, three hundred forty-two billion, one hundred forty million, two hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •