Base | Representation |
---|---|
bin | 10011100000010010010… |
… | …110011101100010000011 |
3 | 11202010122102210121212211 |
4 | 103200102112131202003 |
5 | 133430002421034441 |
6 | 2503424224002551 |
7 | 165556550152513 |
oct | 23402226354203 |
9 | 4663572717784 |
10 | 1340337674371 |
11 | 477485746a63 |
12 | 197924460457 |
13 | 99516108907 |
14 | 48c30935843 |
15 | 24cea3ada81 |
hex | 1381259d883 |
1340337674371 has 2 divisors, whose sum is σ = 1340337674372. Its totient is φ = 1340337674370.
The previous prime is 1340337674369. The next prime is 1340337674407. The reversal of 1340337674371 is 1734767330431.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1340337674371 - 21 = 1340337674369 is a prime.
Together with 1340337674369, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1340337672371) 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, 670168837185 + 670168837186.
It is an arithmetic number, because the mean of its divisors is an integer number (670168837186).
Almost surely, 21340337674371 is an apocalyptic number.
1340337674371 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340337674371 is an equidigital number, since it uses as much as digits as its factorization.
1340337674371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2667168, while the sum is 49.
The spelling of 1340337674371 in words is "one trillion, three hundred forty billion, three hundred thirty-seven million, six hundred seventy-four thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •