Base | Representation |
---|---|
bin | 1011100011110100100000… |
… | …00100011001110101100000 |
3 | 10100000010112211202211111222 |
4 | 11301322100010121311200 |
5 | 11312440212040444412 |
6 | 130021445134554212 |
7 | 5232352061625464 |
oct | 561722004316540 |
9 | 110003484684458 |
10 | 25420033531232 |
11 | 811063725847a |
12 | 2a266a5968968 |
13 | 1125139301312 |
14 | 63c49c6da4a4 |
15 | 2e1377b42072 |
hex | 171e90119d60 |
25420033531232 has 24 divisors (see below), whose sum is σ = 52221590625456. Its totient is φ = 12157407340672.
The previous prime is 25420033531177. The next prime is 25420033531259. The reversal of 25420033531232 is 23213533002452.
It is a junction number, because it is equal to n+sod(n) for n = 25420033531192 and 25420033531201.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 17269043783 + ... + 17269045254.
It is an arithmetic number, because the mean of its divisors is an integer number (2175899609394).
Almost surely, 225420033531232 is an apocalyptic number.
It is an amenable number.
25420033531232 is an abundant number, since it is smaller than the sum of its proper divisors (26801557094224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25420033531232 is a wasteful number, since it uses less digits than its factorization.
25420033531232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34538089070 (or 34538089062 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 35.
Adding to 25420033531232 its reverse (23213533002452), we get a palindrome (48633566533684).
The spelling of 25420033531232 in words is "twenty-five trillion, four hundred twenty billion, thirty-three million, five hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •