Base | Representation |
---|---|
bin | 1011101001001110001010… |
… | …00011100101111111100101 |
3 | 10100122212112201022022221221 |
4 | 11310213011003211333211 |
5 | 11324010240130330221 |
6 | 130243015243140341 |
7 | 5251641534523513 |
oct | 564470503457745 |
9 | 110585481268857 |
10 | 25605606105061 |
11 | 8182305122874 |
12 | 2a566558146b1 |
13 | 11397a15b9718 |
14 | 6474646414b3 |
15 | 2e60d96a3541 |
hex | 1749c50e5fe5 |
25605606105061 has 4 divisors (see below), whose sum is σ = 25675376149312. Its totient is φ = 25535836060812.
The previous prime is 25605606105019. The next prime is 25605606105073. The reversal of 25605606105061 is 16050160650652.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-25605606105061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 25605606104999 and 25605606105017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25605616105061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34885021575 + ... + 34885022308.
It is an arithmetic number, because the mean of its divisors is an integer number (6418844037328).
Almost surely, 225605606105061 is an apocalyptic number.
It is an amenable number.
25605606105061 is a deficient number, since it is larger than the sum of its proper divisors (69770044251).
25605606105061 is an equidigital number, since it uses as much as digits as its factorization.
25605606105061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69770044250.
The product of its (nonzero) digits is 324000, while the sum is 43.
The spelling of 25605606105061 in words is "twenty-five trillion, six hundred five billion, six hundred six million, one hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •