Base | Representation |
---|---|
bin | 10011100000011000000… |
… | …110010011011111100001 |
3 | 11202010220011020200001102 |
4 | 103200120012103133201 |
5 | 133430202112232431 |
6 | 2503441550444145 |
7 | 165562130606363 |
oct | 23403006233741 |
9 | 4663804220042 |
10 | 1340434102241 |
11 | 477525118713 |
12 | 197950803655 |
13 | 9953009b520 |
14 | 48c3d676d33 |
15 | 24d03aa9dcb |
hex | 138181937e1 |
1340434102241 has 4 divisors (see below), whose sum is σ = 1443544417812. Its totient is φ = 1237323786672.
The previous prime is 1340434102237. The next prime is 1340434102253. The reversal of 1340434102241 is 1422014340431.
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 680121843025 + 660312259216 = 824695^2 + 812596^2 .
It is a cyclic number.
It is not a de Polignac number, because 1340434102241 - 22 = 1340434102237 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1340434102201) 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, 51555157766 + ... + 51555157791.
It is an arithmetic number, because the mean of its divisors is an integer number (360886104453).
Almost surely, 21340434102241 is an apocalyptic number.
It is an amenable number.
1340434102241 is a deficient number, since it is larger than the sum of its proper divisors (103110315571).
1340434102241 is a wasteful number, since it uses less digits than its factorization.
1340434102241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103110315570.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 1340434102241 its reverse (1422014340431), we get a palindrome (2762448442672).
The spelling of 1340434102241 in words is "one trillion, three hundred forty billion, four hundred thirty-four million, one hundred two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •