Base | Representation |
---|---|
bin | 1011100110000001011100… |
… | …01110101011011000000000 |
3 | 10100021100212021100022212110 |
4 | 11303000232032223120000 |
5 | 11320210144033444142 |
6 | 130120321421255320 |
7 | 5241001151525211 |
oct | 563005616533000 |
9 | 110240767308773 |
10 | 25495701468672 |
11 | 813a736897866 |
12 | 2a392a2a04540 |
13 | 112c307a9bbb6 |
14 | 641dd9da3408 |
15 | 2e3305b4699c |
hex | 17302e3ab600 |
25495701468672 has 240 divisors, whose sum is σ = 73480446079920. Its totient is φ = 7828449656832.
The previous prime is 25495701468631. The next prime is 25495701468739. The reversal of 25495701468672 is 27686410759452.
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 23 ways as a sum of consecutive naturals, for example, 57460404 + ... + 57902412.
It is an arithmetic number, because the mean of its divisors is an integer number (306168525333).
Almost surely, 225495701468672 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 25495701468672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36740223039960).
25495701468672 is an abundant number, since it is smaller than the sum of its proper divisors (47984744611248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25495701468672 is an equidigital number, since it uses as much as digits as its factorization.
25495701468672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442141 (or 442078 counting only the distinct ones).
The product of its (nonzero) digits is 203212800, while the sum is 66.
The spelling of 25495701468672 in words is "twenty-five trillion, four hundred ninety-five billion, seven hundred one million, four hundred sixty-eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •