Base | Representation |
---|---|
bin | 100111111000110100001… |
… | …001111000101100011001 |
3 | 100201001011110202210001002 |
4 | 213320310021320230121 |
5 | 324402144410012333 |
6 | 5455121045234345 |
7 | 402015060530021 |
oct | 47706411705431 |
9 | 10631143683032 |
10 | 2741064141593 |
11 | 96752a280888 |
12 | 3832a0a029b5 |
13 | 16b63438ab3b |
14 | 9694d808a81 |
15 | 4b47c1bd0e8 |
hex | 27e34278b19 |
2741064141593 has 2 divisors, whose sum is σ = 2741064141594. Its totient is φ = 2741064141592.
The previous prime is 2741064141539. The next prime is 2741064141677. The reversal of 2741064141593 is 3951414601472.
2741064141593 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (2741064141539) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2656600088464 + 84464053129 = 1629908^2 + 290627^2 .
It is a cyclic number.
It is not a de Polignac number, because 2741064141593 - 226 = 2740997032729 is a prime.
It is not a weakly prime, because it can be changed into another prime (2741064341593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1370532070796 + 1370532070797.
It is an arithmetic number, because the mean of its divisors is an integer number (1370532070797).
Almost surely, 22741064141593 is an apocalyptic number.
It is an amenable number.
2741064141593 is a deficient number, since it is larger than the sum of its proper divisors (1).
2741064141593 is an equidigital number, since it uses as much as digits as its factorization.
2741064141593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 2741064141593 in words is "two trillion, seven hundred forty-one billion, sixty-four million, one hundred forty-one thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •