Base | Representation |
---|---|
bin | 10011100100110111001… |
… | …110100111111100001101 |
3 | 11202121022212201220122002 |
4 | 103210313032213330031 |
5 | 134020033321003031 |
6 | 2505555553002045 |
7 | 166122403520405 |
oct | 23446716477415 |
9 | 4677285656562 |
10 | 1345251344141 |
11 | 479577349871 |
12 | 198875b53325 |
13 | 99b1a0cba13 |
14 | 49179363805 |
15 | 24ed6960ccb |
hex | 139373a7f0d |
1345251344141 has 2 divisors, whose sum is σ = 1345251344142. Its totient is φ = 1345251344140.
The previous prime is 1345251344117. The next prime is 1345251344147. The reversal of 1345251344141 is 1414431525431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1332283828516 + 12967515625 = 1154246^2 + 113875^2 .
It is a cyclic number.
It is not a de Polignac number, because 1345251344141 - 218 = 1345251081997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1345251344095 and 1345251344104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1345251344147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 672625672070 + 672625672071.
It is an arithmetic number, because the mean of its divisors is an integer number (672625672071).
Almost surely, 21345251344141 is an apocalyptic number.
It is an amenable number.
1345251344141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1345251344141 is an equidigital number, since it uses as much as digits as its factorization.
1345251344141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 115200, while the sum is 38.
Adding to 1345251344141 its reverse (1414431525431), we get a palindrome (2759682869572).
The spelling of 1345251344141 in words is "one trillion, three hundred forty-five billion, two hundred fifty-one million, three hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •