Base | Representation |
---|---|
bin | 1000001101110000011… |
… | …0000010110101111100 |
3 | 111111021200212022221001 |
4 | 2003130012002311330 |
5 | 4303014132304000 |
6 | 144500202220044 |
7 | 13124241113320 |
oct | 2033406026574 |
9 | 444250768831 |
10 | 141131525500 |
11 | 54943080a89 |
12 | 234287b4624 |
13 | 10402130104 |
14 | 6b8ba15980 |
15 | 3a1023346a |
hex | 20dc182d7c |
141131525500 has 96 divisors (see below), whose sum is σ = 360456864768. Its totient is φ = 47262600000.
The previous prime is 141131525401. The next prime is 141131525533. The reversal of 141131525500 is 5525131141.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 318376 + ... + 619375.
It is an arithmetic number, because the mean of its divisors is an integer number (3754759008).
Almost surely, 2141131525500 is an apocalyptic number.
141131525500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141131525500 is an abundant number, since it is smaller than the sum of its proper divisors (219325339268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141131525500 is a wasteful number, since it uses less digits than its factorization.
141131525500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 937820 (or 937808 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 141131525500 its reverse (5525131141), we get a palindrome (146656656641).
The spelling of 141131525500 in words is "one hundred forty-one billion, one hundred thirty-one million, five hundred twenty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •