Base | Representation |
---|---|
bin | 10011100001111101110… |
… | …110110000000100011101 |
3 | 11202022022010122100111212 |
4 | 103201331312300010131 |
5 | 133442201133113041 |
6 | 2504323213554205 |
7 | 165652340553323 |
oct | 23417566600435 |
9 | 4668263570455 |
10 | 1342141301021 |
11 | 4782208583a4 |
12 | 1981484a5965 |
13 | 99742998611 |
14 | 48d622b3d13 |
15 | 24da38d18eb |
hex | 1387ddb011d |
1342141301021 has 4 divisors (see below), whose sum is σ = 1342144076700. Its totient is φ = 1342138525344.
The previous prime is 1342141301009. The next prime is 1342141301027. The reversal of 1342141301021 is 1201031412431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 708772036996 + 633369264025 = 841886^2 + 795845^2 .
It is a cyclic number.
It is not a de Polignac number, because 1342141301021 - 210 = 1342141299997 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 (1342141301027) 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, 452336 + ... + 1699673.
It is an arithmetic number, because the mean of its divisors is an integer number (335536019175).
Almost surely, 21342141301021 is an apocalyptic number.
It is an amenable number.
1342141301021 is a deficient number, since it is larger than the sum of its proper divisors (2775679).
1342141301021 is an equidigital number, since it uses as much as digits as its factorization.
1342141301021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2775678.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1342141301021 its reverse (1201031412431), we get a palindrome (2543172713452).
The spelling of 1342141301021 in words is "one trillion, three hundred forty-two billion, one hundred forty-one million, three hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •