Base | Representation |
---|---|
bin | 1011010111101000100011… |
… | …10000011111010111000100 |
3 | 10021112002201202120020022121 |
4 | 11223310101300133113010 |
5 | 11234110131423212202 |
6 | 125101235000535324 |
7 | 5160166404222526 |
oct | 553642160372704 |
9 | 107462652506277 |
10 | 25001302554052 |
11 | 7a69aa1566750 |
12 | 2979505781544 |
13 | 10c47c7198636 |
14 | 6260d89cba16 |
15 | 2d551baee537 |
hex | 16bd11c1f5c4 |
25001302554052 has 96 divisors (see below), whose sum is σ = 51023946000384. Its totient is φ = 10604128339200.
The previous prime is 25001302554049. The next prime is 25001302554061. The reversal of 25001302554052 is 25045520310052.
It is a junction number, because it is equal to n+sod(n) for n = 25001302553999 and 25001302554017.
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 31 ways as a sum of consecutive naturals, for example, 850861753 + ... + 850891135.
It is an arithmetic number, because the mean of its divisors is an integer number (531499437504).
Almost surely, 225001302554052 is an apocalyptic number.
25001302554052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
25001302554052 is an abundant number, since it is smaller than the sum of its proper divisors (26022643446332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25001302554052 is a wasteful number, since it uses less digits than its factorization.
25001302554052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49969 (or 49967 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 34.
The spelling of 25001302554052 in words is "twenty-five trillion, one billion, three hundred two million, five hundred fifty-four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •