Base | Representation |
---|---|
bin | 1011011011011001011001… |
… | …00101010011110000100101 |
3 | 10021222110110211120200022200 |
4 | 11231230230211103300211 |
5 | 11243214433004023121 |
6 | 125240501120445113 |
7 | 5202424510214016 |
oct | 555545445236045 |
9 | 107873424520280 |
10 | 25130601626661 |
11 | 8009912512743 |
12 | 299a58b779799 |
13 | 1103a61a9791b |
14 | 62c482d5b00d |
15 | 2d8a8815aa26 |
hex | 16db2c953c25 |
25130601626661 has 12 divisors (see below), whose sum is σ = 36299847972492. Its totient is φ = 16753692848256.
The previous prime is 25130601626621. The next prime is 25130601626687. The reversal of 25130601626661 is 16662610603152.
It can be written as a sum of positive squares in 2 ways, for example, as 1714970965761 + 23415630660900 = 1309569^2 + 4838970^2 .
It is not a de Polignac number, because 25130601626661 - 26 = 25130601626597 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25130601626621) 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 in 11 ways as a sum of consecutive naturals, for example, 617805 + ... + 7116381.
It is an arithmetic number, because the mean of its divisors is an integer number (3024987331041).
Almost surely, 225130601626661 is an apocalyptic number.
It is an amenable number.
25130601626661 is a deficient number, since it is larger than the sum of its proper divisors (11169246345831).
25130601626661 is a wasteful number, since it uses less digits than its factorization.
25130601626661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6928260 (or 6928257 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 45.
The spelling of 25130601626661 in words is "twenty-five trillion, one hundred thirty billion, six hundred one million, six hundred twenty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •