Base | Representation |
---|---|
bin | 110000100001… |
… | …0000000000001 |
3 | 1202212021212001 |
4 | 1201002000001 |
5 | 23002424121 |
6 | 2305104001 |
7 | 426126622 |
oct | 141020001 |
9 | 52767761 |
10 | 25436161 |
11 | 133a3623 |
12 | 8628001 |
13 | 53678aa |
14 | 3541a49 |
15 | 2376991 |
hex | 1842001 |
25436161 has 4 divisors (see below), whose sum is σ = 26313300. Its totient is φ = 24559024.
The previous prime is 25436093. The next prime is 25436189. The reversal of 25436161 is 16163452.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8667136 + 16769025 = 2944^2 + 4095^2 .
It is a cyclic number.
It is not a de Polignac number, because 25436161 - 29 = 25435649 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (25436561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 438526 + ... + 438583.
It is an arithmetic number, because the mean of its divisors is an integer number (6578325).
It is a Proth number, since it is equal to 3105 ⋅ 213 + 1 and 3105 < 213.
Almost surely, 225436161 is an apocalyptic number.
It is an amenable number.
25436161 is a deficient number, since it is larger than the sum of its proper divisors (877139).
25436161 is an equidigital number, since it uses as much as digits as its factorization.
25436161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 877138.
The product of its digits is 4320, while the sum is 28.
The square root of 25436161 is about 5043.4275051794. The cubic root of 25436161 is about 294.0924362650.
The spelling of 25436161 in words is "twenty-five million, four hundred thirty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •