Base | Representation |
---|---|
bin | 1011011000010100101111… |
… | …11001111000100100011100 |
3 | 10021121100222020011202200221 |
4 | 11230022113321320210130 |
5 | 11240002224132000103 |
6 | 125120201131331124 |
7 | 5161666344204130 |
oct | 554122771704434 |
9 | 107540866152627 |
10 | 25025028000028 |
11 | 7a790669a5441 |
12 | 29820272b0aa4 |
13 | 10c6b08636074 |
14 | 6273099993c0 |
15 | 2d5e5995b1bd |
hex | 16c297e7891c |
25025028000028 has 12 divisors (see below), whose sum is σ = 50050056000112. Its totient is φ = 10725012000000.
The previous prime is 25025028000001. The next prime is 25025028000053. The reversal of 25025028000028 is 82000082052052.
25025028000028 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 25025027999957 and 25025028000002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 446875499973 + ... + 446875500028.
Almost surely, 225025028000028 is an apocalyptic number.
25025028000028 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
25025028000028 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25025028000028 is a wasteful number, since it uses less digits than its factorization.
25025028000028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 893751000012 (or 893751000010 counting only the distinct ones).
The product of its (nonzero) digits is 25600, while the sum is 34.
The spelling of 25025028000028 in words is "twenty-five trillion, twenty-five billion, twenty-eight million, twenty-eight", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •