Base | Representation |
---|---|
bin | 10111101100011111… |
… | …001011110001100001 |
3 | 2102200010102120100202 |
4 | 113230133023301201 |
5 | 404101230343040 |
6 | 15404343354545 |
7 | 1560326056562 |
oct | 275437136141 |
9 | 72603376322 |
10 | 25442434145 |
11 | a876655387 |
12 | 4b20752a55 |
13 | 25260b457b |
14 | 1335036169 |
15 | 9dd969015 |
hex | 5ec7cbc61 |
25442434145 has 12 divisors (see below), whose sum is σ = 31257465876. Its totient is φ = 19880592480.
The previous prime is 25442434109. The next prime is 25442434169. The reversal of 25442434145 is 54143424452.
It can be written as a sum of positive squares in 2 ways, for example, as 18886455184 + 6555978961 = 137428^2 + 80969^2 .
It is not a de Polignac number, because 25442434145 - 26 = 25442434081 is a prime.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 25442434099 and 25442434108.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1366766 + ... + 1385255.
It is an arithmetic number, because the mean of its divisors is an integer number (2604788823).
Almost surely, 225442434145 is an apocalyptic number.
It is an amenable number.
25442434145 is a deficient number, since it is larger than the sum of its proper divisors (5815031731).
25442434145 is an equidigital number, since it uses as much as digits as its factorization.
25442434145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2752112 (or 2752069 counting only the distinct ones).
The product of its digits is 307200, while the sum is 38.
Adding to 25442434145 its reverse (54143424452), we get a palindrome (79585858597).
The spelling of 25442434145 in words is "twenty-five billion, four hundred forty-two million, four hundred thirty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •