Base | Representation |
---|---|
bin | 110000100001… |
… | …1111100101101 |
3 | 1202212200210121 |
4 | 1201003330231 |
5 | 23003203031 |
6 | 2305204541 |
7 | 426162112 |
oct | 141037455 |
9 | 52780717 |
10 | 25444141 |
11 | 133a9618 |
12 | 8630751 |
13 | 536b408 |
14 | 3544909 |
15 | 2379011 |
hex | 1843f2d |
25444141 has 4 divisors (see below), whose sum is σ = 26550432. Its totient is φ = 24337852.
The previous prime is 25444129. The next prime is 25444151. The reversal of 25444141 is 14144452.
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 not a de Polignac number, because 25444141 - 211 = 25442093 is a prime.
It is a super-2 number, since 2×254441412 = 1294808622455762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25444151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 553111 + ... + 553156.
It is an arithmetic number, because the mean of its divisors is an integer number (6637608).
Almost surely, 225444141 is an apocalyptic number.
It is an amenable number.
25444141 is a deficient number, since it is larger than the sum of its proper divisors (1106291).
25444141 is a wasteful number, since it uses less digits than its factorization.
25444141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1106290.
The product of its digits is 2560, while the sum is 25.
The square root of 25444141 is about 5044.2185717909. The cubic root of 25444141 is about 294.1231879215.
Adding to 25444141 its reverse (14144452), we get a palindrome (39588593).
The spelling of 25444141 in words is "twenty-five million, four hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •