Base | Representation |
---|---|
bin | 100101111010001000010… |
… | …000101110010111000101 |
3 | 100020001001110022202220211 |
4 | 211322020100232113011 |
5 | 320140103241020244 |
6 | 5312423115555421 |
7 | 356131140630064 |
oct | 45721020562705 |
9 | 10201043282824 |
10 | 2605036266949 |
11 | 914876072276 |
12 | 360a5945bb71 |
13 | 15b86670aa9c |
14 | 901279561db |
15 | 47b6a067934 |
hex | 25e8842e5c5 |
2605036266949 has 2 divisors, whose sum is σ = 2605036266950. Its totient is φ = 2605036266948.
The previous prime is 2605036266919. The next prime is 2605036267033. The reversal of 2605036266949 is 9496626305062.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2001144085924 + 603892181025 = 1414618^2 + 777105^2 .
It is a cyclic number.
It is not a de Polignac number, because 2605036266949 - 213 = 2605036258757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2605036266893 and 2605036266902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2605036266919) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1302518133474 + 1302518133475.
It is an arithmetic number, because the mean of its divisors is an integer number (1302518133475).
Almost surely, 22605036266949 is an apocalyptic number.
It is an amenable number.
2605036266949 is a deficient number, since it is larger than the sum of its proper divisors (1).
2605036266949 is an equidigital number, since it uses as much as digits as its factorization.
2605036266949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25194240, while the sum is 58.
The spelling of 2605036266949 in words is "two trillion, six hundred five billion, thirty-six million, two hundred sixty-six thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •