Base | Representation |
---|---|
bin | 111111010110110… |
… | …1110111110000000 |
3 | 12111011021211100200 |
4 | 1332231232332000 |
5 | 13323213334310 |
6 | 550541445200 |
7 | 103453001616 |
oct | 17655567600 |
9 | 5434254320 |
10 | 2125918080 |
11 | 9a10307a0 |
12 | 4b3b70800 |
13 | 27b593bc0 |
14 | 1624b56b6 |
15 | c69869c0 |
hex | 7eb6ef80 |
2125918080 has 768 divisors, whose sum is σ = 9022104000. Its totient is φ = 454164480.
The previous prime is 2125918073. The next prime is 2125918103. The reversal of 2125918080 is 808195212.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 95 ways as a sum of consecutive naturals, for example, 23886676 + ... + 23886764.
Almost surely, 22125918080 is an apocalyptic number.
2125918080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2125918080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4511052000).
2125918080 is an abundant number, since it is smaller than the sum of its proper divisors (6896185920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2125918080 is a wasteful number, since it uses less digits than its factorization.
2125918080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167 (or 152 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 36.
The square root of 2125918080 is about 46107.6791868773. The cubic root of 2125918080 is about 1285.8259170799.
The spelling of 2125918080 in words is "two billion, one hundred twenty-five million, nine hundred eighteen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •