Base | Representation |
---|---|
bin | 10011100001110110001… |
… | …111000000000011001001 |
3 | 11202021222020001100102221 |
4 | 103201312033000003021 |
5 | 133441420420041301 |
6 | 2504302405254041 |
7 | 165646226012260 |
oct | 23416617000311 |
9 | 4667866040387 |
10 | 1342013440201 |
11 | 4781656676a5 |
12 | 198111704321 |
13 | 9972234b725 |
14 | 48d4d30d5d7 |
15 | 24d97576da1 |
hex | 138763c00c9 |
1342013440201 has 4 divisors (see below), whose sum is σ = 1533729645952. Its totient is φ = 1150297234452.
The previous prime is 1342013440151. The next prime is 1342013440331. The reversal of 1342013440201 is 1020443102431.
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 cyclic number.
It is not a de Polignac number, because 1342013440201 - 231 = 1339865956553 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1342013446201) 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 3 ways as a sum of consecutive naturals, for example, 95858102865 + ... + 95858102878.
It is an arithmetic number, because the mean of its divisors is an integer number (383432411488).
Almost surely, 21342013440201 is an apocalyptic number.
It is an amenable number.
1342013440201 is a deficient number, since it is larger than the sum of its proper divisors (191716205751).
1342013440201 is an equidigital number, since it uses as much as digits as its factorization.
1342013440201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191716205750.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1342013440201 its reverse (1020443102431), we get a palindrome (2362456542632).
The spelling of 1342013440201 in words is "one trillion, three hundred forty-two billion, thirteen million, four hundred forty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •