Base | Representation |
---|---|
bin | 100110000010010010001… |
… | …010010110111011001001 |
3 | 100020212122200100120211112 |
4 | 212002102022112323021 |
5 | 320311021312223331 |
6 | 5320432024140105 |
7 | 356561132004254 |
oct | 46022212267311 |
9 | 10225580316745 |
10 | 2613792304841 |
11 | 918559684123 |
12 | 3626a1907635 |
13 | 15c6307809b3 |
14 | 907187c409b |
15 | 47ecdb0432b |
hex | 26092296ec9 |
2613792304841 has 2 divisors, whose sum is σ = 2613792304842. Its totient is φ = 2613792304840.
The previous prime is 2613792304819. The next prime is 2613792304853. The reversal of 2613792304841 is 1484032973162.
2613792304841 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2066334375625 + 547457929216 = 1437475^2 + 739904^2 .
It is a cyclic number.
It is not a de Polignac number, because 2613792304841 - 210 = 2613792303817 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2613792304841.
It is not a weakly prime, because it can be changed into another prime (2613792304811) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1306896152420 + 1306896152421.
It is an arithmetic number, because the mean of its divisors is an integer number (1306896152421).
Almost surely, 22613792304841 is an apocalyptic number.
It is an amenable number.
2613792304841 is a deficient number, since it is larger than the sum of its proper divisors (1).
2613792304841 is an equidigital number, since it uses as much as digits as its factorization.
2613792304841 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1741824, while the sum is 50.
The spelling of 2613792304841 in words is "two trillion, six hundred thirteen billion, seven hundred ninety-two million, three hundred four thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •