Base | Representation |
---|---|
bin | 10011100000010010010… |
… | …001101111100010000101 |
3 | 11202010122100110210001101 |
4 | 103200102101233202011 |
5 | 133430002111444011 |
6 | 2503424141300101 |
7 | 165556533511234 |
oct | 23402221574205 |
9 | 4663570423041 |
10 | 1340336437381 |
11 | 477484a81657 |
12 | 197923b64631 |
13 | 99515a94876 |
14 | 48c306d2b1b |
15 | 24cea2172c1 |
hex | 1381246f885 |
1340336437381 has 2 divisors, whose sum is σ = 1340336437382. Its totient is φ = 1340336437380.
The previous prime is 1340336437369. The next prime is 1340336437459. The reversal of 1340336437381 is 1837346330431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 742080596481 + 598255840900 = 861441^2 + 773470^2 .
It is a cyclic number.
It is not a de Polignac number, because 1340336437381 - 231 = 1338188953733 is a prime.
It is a super-2 number, since 2×13403364373812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1340336437301) 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 as a sum of consecutive naturals, namely, 670168218690 + 670168218691.
It is an arithmetic number, because the mean of its divisors is an integer number (670168218691).
Almost surely, 21340336437381 is an apocalyptic number.
It is an amenable number.
1340336437381 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340336437381 is an equidigital number, since it uses as much as digits as its factorization.
1340336437381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 46.
The spelling of 1340336437381 in words is "one trillion, three hundred forty billion, three hundred thirty-six million, four hundred thirty-seven thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •