Base | Representation |
---|---|
bin | 100100011000010100111… |
… | …101111100101110000000 |
3 | 22211222222212212101110011 |
4 | 210120110331330232000 |
5 | 311430021311000310 |
6 | 5152254455514304 |
7 | 345422615516242 |
oct | 44302475745600 |
9 | 8758885771404 |
10 | 2500022750080 |
11 | 8842877377a9 |
12 | 344630688994 |
13 | 15199c31921b |
14 | 89004b16092 |
15 | 45070b0678a |
hex | 24614f7cb80 |
2500022750080 has 32 divisors (see below), whose sum is σ = 5976616888440. Its totient is φ = 1000009099776.
The previous prime is 2500022750009. The next prime is 2500022750081. The reversal of 2500022750080 is 800572200052.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×25000227500802 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2500022750081) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1953142134 + ... + 1953143413.
Almost surely, 22500022750080 is an apocalyptic number.
2500022750080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2500022750080 is an abundant number, since it is smaller than the sum of its proper divisors (3476594138360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2500022750080 is an equidigital number, since it uses as much as digits as its factorization.
2500022750080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3906285566 (or 3906285554 counting only the distinct ones).
The product of its (nonzero) digits is 11200, while the sum is 31.
The spelling of 2500022750080 in words is "two trillion, five hundred billion, twenty-two million, seven hundred fifty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •