Base | Representation |
---|---|
bin | 100101111010001000010… |
… | …000101100011000011001 |
3 | 100020001001110022100210112 |
4 | 211322020100230120121 |
5 | 320140103240240331 |
6 | 5312423115454105 |
7 | 356131140564332 |
oct | 45721020543031 |
9 | 10201043270715 |
10 | 2605036258841 |
11 | 914876067175 |
12 | 360a59457335 |
13 | 15b8667071a3 |
14 | 90127953289 |
15 | 47b6a06532b |
hex | 25e8842c619 |
2605036258841 has 2 divisors, whose sum is σ = 2605036258842. Its totient is φ = 2605036258840.
The previous prime is 2605036258777. The next prime is 2605036258879. The reversal of 2605036258841 is 1488526305062.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2603046652816 + 1989606025 = 1613396^2 + 44605^2 .
It is a cyclic number.
It is not a de Polignac number, because 2605036258841 - 26 = 2605036258777 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2605036258841.
It is not a weakly prime, because it can be changed into another prime (2605036258141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1302518129420 + 1302518129421.
It is an arithmetic number, because the mean of its divisors is an integer number (1302518129421).
Almost surely, 22605036258841 is an apocalyptic number.
It is an amenable number.
2605036258841 is a deficient number, since it is larger than the sum of its proper divisors (1).
2605036258841 is an equidigital number, since it uses as much as digits as its factorization.
2605036258841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2764800, while the sum is 50.
The spelling of 2605036258841 in words is "two trillion, six hundred five billion, thirty-six million, two hundred fifty-eight thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •