Base | Representation |
---|---|
bin | 1010100010011100001100111… |
… | …1100011011000010110000001 |
3 | 10121020121222222202010112112201 |
4 | 2220213003033203120112001 |
5 | 1234144120332014213031 |
6 | 11145053454420153201 |
7 | 312124415002214236 |
oct | 25047031743302601 |
9 | 3536558882115481 |
10 | 741555355616641 |
11 | 1a5311950a34685 |
12 | 6b206490238801 |
13 | 25aa14a6b03a67 |
14 | d11968390778d |
15 | 5aae853697d61 |
hex | 2a270cf8d8581 |
741555355616641 has 2 divisors, whose sum is σ = 741555355616642. Its totient is φ = 741555355616640.
The previous prime is 741555355616573. The next prime is 741555355616711. The reversal of 741555355616641 is 146616553555147.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 577811213591616 + 163744142025025 = 24037704^2 + 12796255^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-741555355616641 is a prime.
It is a super-2 number, since 2×7415553556166412 (a number of 31 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (741555355616441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 370777677808320 + 370777677808321.
It is an arithmetic number, because the mean of its divisors is an integer number (370777677808321).
Almost surely, 2741555355616641 is an apocalyptic number.
It is an amenable number.
741555355616641 is a deficient number, since it is larger than the sum of its proper divisors (1).
741555355616641 is an equidigital number, since it uses as much as digits as its factorization.
741555355616641 is an evil number, because the sum of its binary digits is even.
The product of its digits is 226800000, while the sum is 64.
The spelling of 741555355616641 in words is "seven hundred forty-one trillion, five hundred fifty-five billion, three hundred fifty-five million, six hundred sixteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •