Base | Representation |
---|---|
bin | 10011100001011111000… |
… | …111100110111111001001 |
3 | 11202020222012022101011002 |
4 | 103201133013212333021 |
5 | 133440122130022234 |
6 | 2504200113144345 |
7 | 165633506444264 |
oct | 23413707467711 |
9 | 4666865271132 |
10 | 1341625626569 |
11 | 477a86765568 |
12 | 19802385b0b5 |
13 | 9968cbb5bc7 |
14 | 48d139dbcdb |
15 | 24d734be27e |
hex | 1385f1e6fc9 |
1341625626569 has 2 divisors, whose sum is σ = 1341625626570. Its totient is φ = 1341625626568.
The previous prime is 1341625626491. The next prime is 1341625626571. The reversal of 1341625626569 is 9656265261431.
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., 769151802169 + 572473824400 = 877013^2 + 756620^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1341625626569 is a prime.
It is a super-2 number, since 2×13416256265692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 1341625626571, 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 (1341625622569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 670812813284 + 670812813285.
It is an arithmetic number, because the mean of its divisors is an integer number (670812813285).
Almost surely, 21341625626569 is an apocalyptic number.
It is an amenable number.
1341625626569 is a deficient number, since it is larger than the sum of its proper divisors (1).
1341625626569 is an equidigital number, since it uses as much as digits as its factorization.
1341625626569 is an evil number, because the sum of its binary digits is even.
The product of its digits is 13996800, while the sum is 56.
The spelling of 1341625626569 in words is "one trillion, three hundred forty-one billion, six hundred twenty-five million, six hundred twenty-six thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •