Base | Representation |
---|---|
bin | 110000111101… |
… | …1010110000001 |
3 | 1210022020001022 |
4 | 1201323112001 |
5 | 23032433131 |
6 | 2314115225 |
7 | 431125454 |
oct | 141732601 |
9 | 53266038 |
10 | 25671041 |
11 | 13544040 |
12 | 871bb15 |
13 | 541a786 |
14 | 35a349b |
15 | 23c137b |
hex | 187b581 |
25671041 has 4 divisors (see below), whose sum is σ = 28004784. Its totient is φ = 23337300.
The previous prime is 25671029. The next prime is 25671053. The reversal of 25671041 is 14017652.
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 an interprime number because it is at equal distance from previous prime (25671029) and next prime (25671053).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-25671041 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 25671041.
It is not an unprimeable number, because it can be changed into a prime (25671011) 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, 1166855 + ... + 1166876.
It is an arithmetic number, because the mean of its divisors is an integer number (7001196).
Almost surely, 225671041 is an apocalyptic number.
It is an amenable number.
25671041 is a deficient number, since it is larger than the sum of its proper divisors (2333743).
25671041 is a wasteful number, since it uses less digits than its factorization.
25671041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2333742.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 25671041 is about 5066.6597478023. The cubic root of 25671041 is about 294.9948902687.
Adding to 25671041 its reverse (14017652), we get a palindrome (39688693).
The spelling of 25671041 in words is "twenty-five million, six hundred seventy-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •