Base | Representation |
---|---|
bin | 1011011011011011010101… |
… | …00000111010111001100010 |
3 | 10021222120011020201020010010 |
4 | 11231231222200322321202 |
5 | 11243224100002214100 |
6 | 125241152154545350 |
7 | 5202462324662253 |
oct | 555555240727142 |
9 | 107876136636103 |
10 | 25131640663650 |
11 | 800a2a5a795a4 |
12 | 299a81b738256 |
13 | 1103b99122201 |
14 | 62c540d4ab2a |
15 | 2d8ae949d750 |
hex | 16db6a83ae62 |
25131640663650 has 96 divisors (see below), whose sum is σ = 64026417761280. Its totient is φ = 6519068075520.
The previous prime is 25131640663639. The next prime is 25131640663667. The reversal of 25131640663650 is 5636604613152.
It is a self number, because there is not a number n which added to its sum of digits gives 25131640663650.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22538062 + ... + 23626838.
It is an arithmetic number, because the mean of its divisors is an integer number (666941851680).
Almost surely, 225131640663650 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25131640663650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32013208880640).
25131640663650 is an abundant number, since it is smaller than the sum of its proper divisors (38894777097630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25131640663650 is a wasteful number, since it uses less digits than its factorization.
25131640663650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1092988 (or 1092983 counting only the distinct ones).
The product of its (nonzero) digits is 2332800, while the sum is 48.
The spelling of 25131640663650 in words is "twenty-five trillion, one hundred thirty-one billion, six hundred forty million, six hundred sixty-three thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •