Base | Representation |
---|---|
bin | 10011100000010000101… |
… | …101011000111001111101 |
3 | 11202010120111222020112002 |
4 | 103200100231120321331 |
5 | 133424423343132201 |
6 | 2503421401352045 |
7 | 165556064063222 |
oct | 23402055307175 |
9 | 4663514866462 |
10 | 1340310130301 |
11 | 47747114376a |
12 | 197917198625 |
13 | 995104b374c |
14 | 48c2b005949 |
15 | 24ce7c6c76b |
hex | 13810b58e7d |
1340310130301 has 2 divisors, whose sum is σ = 1340310130302. Its totient is φ = 1340310130300.
The previous prime is 1340310130283. The next prime is 1340310130391. The reversal of 1340310130301 is 1030310130431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1008315214201 + 331994916100 = 1004149^2 + 576190^2 .
It is an emirp because it is prime and its reverse (1030310130431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1340310130301 - 238 = 1065432223357 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1340310130391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 670155065150 + 670155065151.
It is an arithmetic number, because the mean of its divisors is an integer number (670155065151).
Almost surely, 21340310130301 is an apocalyptic number.
It is an amenable number.
1340310130301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340310130301 is an equidigital number, since it uses as much as digits as its factorization.
1340310130301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1340310130301 its reverse (1030310130431), we get a palindrome (2370620260732).
The spelling of 1340310130301 in words is "one trillion, three hundred forty billion, three hundred ten million, one hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •