Base | Representation |
---|---|
bin | 1011100100011110110010… |
… | …11011010111111010000000 |
3 | 10100002022011020100112220012 |
4 | 11302033121123113322000 |
5 | 11313323212204012023 |
6 | 130040122154404052 |
7 | 5234114536166450 |
oct | 562173133277200 |
9 | 110068136315805 |
10 | 25442739125888 |
11 | 811a228a44837 |
12 | 2a2ab81a30628 |
13 | 11273173a1026 |
14 | 63d61406dd60 |
15 | 2e1c5619a978 |
hex | 1723d96d7e80 |
25442739125888 has 64 divisors (see below), whose sum is σ = 58015302731520. Its totient is φ = 10887534535680.
The previous prime is 25442739125831. The next prime is 25442739125957. The reversal of 25442739125888 is 88852193724452.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Smith number, since the sum of its digits (68) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20887256 + ... + 22071767.
It is an arithmetic number, because the mean of its divisors is an integer number (906489105180).
Almost surely, 225442739125888 is an apocalyptic number.
25442739125888 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
25442739125888 is an abundant number, since it is smaller than the sum of its proper divisors (32572563605632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25442739125888 is an equidigital number, since it uses as much as digits as its factorization.
25442739125888 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42959705 (or 42959693 counting only the distinct ones).
The product of its digits is 309657600, while the sum is 68.
The spelling of 25442739125888 in words is "twenty-five trillion, four hundred forty-two billion, seven hundred thirty-nine million, one hundred twenty-five thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •