Base | Representation |
---|---|
bin | 110000111110… |
… | …1000000110000 |
3 | 1210022120102022 |
4 | 1201331000300 |
5 | 23033142442 |
6 | 2314211012 |
7 | 431154413 |
oct | 141750060 |
9 | 53276368 |
10 | 25677872 |
11 | 13549190 |
12 | 8723a68 |
13 | 542090c |
14 | 35a5b7a |
15 | 23c33d2 |
hex | 187d030 |
25677872 has 20 divisors (see below), whose sum is σ = 54274056. Its totient is φ = 11671680.
The previous prime is 25677863. The next prime is 25677881. The reversal of 25677872 is 27877652.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (25677863) and next prime (25677881).
It is a super-2 number, since 2×256778722 = 1318706220896768, which contains 22 as substring.
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72773 + ... + 73124.
Almost surely, 225677872 is an apocalyptic number.
25677872 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
25677872 is an abundant number, since it is smaller than the sum of its proper divisors (28596184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25677872 is a wasteful number, since it uses less digits than its factorization.
25677872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145916 (or 145910 counting only the distinct ones).
The product of its digits is 329280, while the sum is 44.
The square root of 25677872 is about 5067.3338157260. Note that the first 3 decimals coincide. The cubic root of 25677872 is about 295.0210537497.
The spelling of 25677872 in words is "twenty-five million, six hundred seventy-seven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •