Base | Representation |
---|---|
bin | 11111000111101000111… |
… | …000000100011100100100 |
3 | 21120102212010212101201111 |
4 | 133013220320010130210 |
5 | 240014124433233000 |
6 | 4314225504034404 |
7 | 310334111012116 |
oct | 37075070043444 |
9 | 7512763771644 |
10 | 2138505758500 |
11 | 754a318281a1 |
12 | 2a6559302a04 |
13 | 12687769c1a7 |
14 | 7570b8773b6 |
15 | 3a962940cba |
hex | 1f1e8e04724 |
2138505758500 has 48 divisors (see below), whose sum is σ = 4670707113072. Its totient is φ = 855363744000.
The previous prime is 2138505758461. The next prime is 2138505758513. The reversal of 2138505758500 is 58575058312.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 1186042971136 + 952462787364 = 1089056^2 + 975942^2 .
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, 12704890 + ... + 12872110.
It is an arithmetic number, because the mean of its divisors is an integer number (97306398189).
Almost surely, 22138505758500 is an apocalyptic number.
2138505758500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2138505758500 is an abundant number, since it is smaller than the sum of its proper divisors (2532201354572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2138505758500 is a wasteful number, since it uses less digits than its factorization.
2138505758500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192817 (or 192805 counting only the distinct ones).
The product of its (nonzero) digits is 1680000, while the sum is 49.
The spelling of 2138505758500 in words is "two trillion, one hundred thirty-eight billion, five hundred five million, seven hundred fifty-eight thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •