Base | Representation |
---|---|
bin | 10111100000011111… |
… | …010011111110000001 |
3 | 2102011002122211020120 |
4 | 113200133103332001 |
5 | 403143213003441 |
6 | 15332353130453 |
7 | 1552333105500 |
oct | 274037237601 |
9 | 72132584216 |
10 | 25241141121 |
11 | a782a69a09 |
12 | 4a85259a29 |
13 | 24c3496881 |
14 | 13163d8837 |
15 | 9cae56966 |
hex | 5e07d3f81 |
25241141121 has 24 divisors (see below), whose sum is σ = 39159218880. Its totient is φ = 14419937952.
The previous prime is 25241141113. The next prime is 25241141141. The reversal of 25241141121 is 12114114252.
It is not a de Polignac number, because 25241141121 - 23 = 25241141113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 25241141091 and 25241141100.
It is not an unprimeable number, because it can be changed into a prime (25241141141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 645295 + ... + 683291.
It is an arithmetic number, because the mean of its divisors is an integer number (1631634120).
Almost surely, 225241141121 is an apocalyptic number.
25241141121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
25241141121 is a deficient number, since it is larger than the sum of its proper divisors (13918077759).
25241141121 is a wasteful number, since it uses less digits than its factorization.
25241141121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42533 (or 42526 counting only the distinct ones).
The product of its digits is 640, while the sum is 24.
Adding to 25241141121 its reverse (12114114252), we get a palindrome (37355255373).
The spelling of 25241141121 in words is "twenty-five billion, two hundred forty-one million, one hundred forty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •