Base | Representation |
---|---|
bin | 100101111010001111110… |
… | …101001010101001001101 |
3 | 100020001101022021201022102 |
4 | 211322033311022221031 |
5 | 320140333243313433 |
6 | 5312443453524445 |
7 | 356134242226463 |
oct | 45721765125115 |
9 | 10201338251272 |
10 | 2605163260493 |
11 | 914930820412 |
12 | 360a93aa3725 |
13 | 15b886b12cb1 |
14 | 9013a772833 |
15 | 47b762a04e8 |
hex | 25e8fd4aa4d |
2605163260493 has 2 divisors, whose sum is σ = 2605163260494. Its totient is φ = 2605163260492.
The previous prime is 2605163260457. The next prime is 2605163260547. The reversal of 2605163260493 is 3940623615062.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2186796203524 + 418367056969 = 1478782^2 + 646813^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2605163260493 is a prime.
It is a super-2 number, since 2×26051632604932 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2605163260793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1302581630246 + 1302581630247.
It is an arithmetic number, because the mean of its divisors is an integer number (1302581630247).
Almost surely, 22605163260493 is an apocalyptic number.
It is an amenable number.
2605163260493 is a deficient number, since it is larger than the sum of its proper divisors (1).
2605163260493 is an equidigital number, since it uses as much as digits as its factorization.
2605163260493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 47.
The spelling of 2605163260493 in words is "two trillion, six hundred five billion, one hundred sixty-three million, two hundred sixty thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •