Base | Representation |
---|---|
bin | 10111011010011001… |
… | …101110100101110000 |
3 | 2101212222111020011121 |
4 | 113122121232211300 |
5 | 402441041422000 |
6 | 15314304152024 |
7 | 1546653044002 |
oct | 273231564560 |
9 | 71788436147 |
10 | 25139014000 |
11 | a730355331 |
12 | 4a57008614 |
13 | 24a8289b19 |
14 | 1306a12372 |
15 | 9c1ed1b1a |
hex | 5da66e970 |
25139014000 has 80 divisors (see below), whose sum is σ = 63985502880. Its totient is φ = 9526348800.
The previous prime is 25139013989. The next prime is 25139014031. The reversal of 25139014000 is 41093152.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-4 number, since 4×251390140004 (a number of 43 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
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 15 ways as a sum of consecutive naturals, for example, 292777 + ... + 368776.
It is an arithmetic number, because the mean of its divisors is an integer number (799818786).
Almost surely, 225139014000 is an apocalyptic number.
25139014000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
25139014000 is an abundant number, since it is smaller than the sum of its proper divisors (38846488880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25139014000 is a wasteful number, since it uses less digits than its factorization.
25139014000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661595 (or 661579 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
The spelling of 25139014000 in words is "twenty-five billion, one hundred thirty-nine million, fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •