Base | Representation |
---|---|
bin | 1011100001101000111100… |
… | …11001100011110001110001 |
3 | 10022201222011102202020120212 |
4 | 11300310132121203301301 |
5 | 11310223242134432241 |
6 | 125523214515113505 |
7 | 5224060334443616 |
oct | 560643631436161 |
9 | 108658142666525 |
10 | 25345112030321 |
11 | 809188aaa4986 |
12 | 2a140768a2895 |
13 | 111b059381265 |
14 | 6389d221850d |
15 | 2de440433beb |
hex | 170d1e663c71 |
25345112030321 has 8 divisors (see below), whose sum is σ = 25569513037824. Its totient is φ = 25120712917440.
The previous prime is 25345112030311. The next prime is 25345112030323. The reversal of 25345112030321 is 12303021154352.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 25345112030321 - 218 = 25345111768177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (25345112030323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53083760 + ... + 53559086.
It is an arithmetic number, because the mean of its divisors is an integer number (3196189129728).
Almost surely, 225345112030321 is an apocalyptic number.
It is an amenable number.
25345112030321 is a deficient number, since it is larger than the sum of its proper divisors (224401007503).
25345112030321 is a wasteful number, since it uses less digits than its factorization.
25345112030321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947311.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 25345112030321 its reverse (12303021154352), we get a palindrome (37648133184673).
The spelling of 25345112030321 in words is "twenty-five trillion, three hundred forty-five billion, one hundred twelve million, thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •