Base | Representation |
---|---|
bin | 1000001011011111100… |
… | …0101101111000100000 |
3 | 111102201100210110221112 |
4 | 2002313320231320200 |
5 | 4300243124131000 |
6 | 144320022042452 |
7 | 13103213506463 |
oct | 2026770557040 |
9 | 442640713845 |
10 | 140524052000 |
11 | 54661189172 |
12 | 23299279428 |
13 | 10336318937 |
14 | 6b310852da |
15 | 39c6c3b235 |
hex | 20b7e2de20 |
140524052000 has 96 divisors (see below), whose sum is σ = 350131227264. Its totient is φ = 55417824000.
The previous prime is 140524051991. The next prime is 140524052021. The reversal of 140524052000 is 250425041.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36599 + ... + 531401.
It is an arithmetic number, because the mean of its divisors is an integer number (3647200284).
Almost surely, 2140524052000 is an apocalyptic number.
140524052000 is a gapful number since it is divisible by the number (10) 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 140524052000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175065613632).
140524052000 is an abundant number, since it is smaller than the sum of its proper divisors (209607175264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140524052000 is an equidigital number, since it uses as much as digits as its factorization.
140524052000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 494899 (or 494881 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 23.
Adding to 140524052000 its reverse (250425041), we get a palindrome (140774477041).
The spelling of 140524052000 in words is "one hundred forty billion, five hundred twenty-four million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •