Base | Representation |
---|---|
bin | 10011100000010110001… |
… | …011111101110000011001 |
3 | 11202010210220220022110102 |
4 | 103200112023331300121 |
5 | 133430120410003031 |
6 | 2503434443225145 |
7 | 165561261165161 |
oct | 23402613756031 |
9 | 4663726808412 |
10 | 1340402031641 |
11 | 477509003592 |
12 | 197941b181b5 |
13 | 9952654cc3a |
14 | 48c392c95a1 |
15 | 24d00d727cb |
hex | 138162fdc19 |
1340402031641 has 2 divisors, whose sum is σ = 1340402031642. Its totient is φ = 1340402031640.
The previous prime is 1340402031613. The next prime is 1340402031643. The reversal of 1340402031641 is 1461302040431.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1045557375625 + 294844656016 = 1022525^2 + 542996^2 .
It is an emirp because it is prime and its reverse (1461302040431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1340402031641 is a prime.
It is a Sophie Germain prime.
Together with 1340402031643, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1340402031643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 670201015820 + 670201015821.
It is an arithmetic number, because the mean of its divisors is an integer number (670201015821).
Almost surely, 21340402031641 is an apocalyptic number.
It is an amenable number.
1340402031641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340402031641 is an equidigital number, since it uses as much as digits as its factorization.
1340402031641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 29.
The spelling of 1340402031641 in words is "one trillion, three hundred forty billion, four hundred two million, thirty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •