Base | Representation |
---|---|
bin | 10111101101000001… |
… | …110001101010011000 |
3 | 2102200202111021102211 |
4 | 113231001301222120 |
5 | 404111041032412 |
6 | 15405310004504 |
7 | 1560466125262 |
oct | 275501615230 |
9 | 72622437384 |
10 | 25451502232 |
11 | a880789372 |
12 | 4b237a6734 |
13 | 2527c3abc0 |
14 | 1336316b32 |
15 | 9de65aca7 |
hex | 5ed071a98 |
25451502232 has 64 divisors (see below), whose sum is σ = 53254404000. Its totient is φ = 11322630144.
The previous prime is 25451502149. The next prime is 25451502257. The reversal of 25451502232 is 23220515452.
It is a junction number, because it is equal to n+sod(n) for n = 25451502194 and 25451502203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1860088 + ... + 1873720.
Almost surely, 225451502232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25451502232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26627202000).
25451502232 is an abundant number, since it is smaller than the sum of its proper divisors (27802901768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25451502232 is a wasteful number, since it uses less digits than its factorization.
25451502232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14300 (or 14296 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 31.
The spelling of 25451502232 in words is "twenty-five billion, four hundred fifty-one million, five hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •