Base | Representation |
---|---|
bin | 10011100000011111111… |
… | …000001101000010001101 |
3 | 11202011020020211211120011 |
4 | 103200133320031002031 |
5 | 133430434020423001 |
6 | 2503502532153221 |
7 | 165565304201005 |
oct | 23403770150215 |
9 | 4664206754504 |
10 | 1340564623501 |
11 | 477591866224 |
12 | 197988468811 |
13 | 9955113a33c |
14 | 48c52b31005 |
15 | 24d1028cd51 |
hex | 1381fe0d08d |
1340564623501 has 2 divisors, whose sum is σ = 1340564623502. Its totient is φ = 1340564623500.
The previous prime is 1340564623477. The next prime is 1340564623513. The reversal of 1340564623501 is 1053264650431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1301687037225 + 38877586276 = 1140915^2 + 197174^2 .
It is a cyclic number.
It is not a de Polignac number, because 1340564623501 - 215 = 1340564590733 is a prime.
It is a super-2 number, since 2×13405646235012 (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 (1340564623301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 670282311750 + 670282311751.
It is an arithmetic number, because the mean of its divisors is an integer number (670282311751).
Almost surely, 21340564623501 is an apocalyptic number.
It is an amenable number.
1340564623501 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340564623501 is an equidigital number, since it uses as much as digits as its factorization.
1340564623501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 40.
The spelling of 1340564623501 in words is "one trillion, three hundred forty billion, five hundred sixty-four million, six hundred twenty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •