Base | Representation |
---|---|
bin | 1000001001100100111… |
… | …1110101111010010100 |
3 | 111101101112112222021211 |
4 | 2002121033311322110 |
5 | 4243220031124000 |
6 | 144153020351204 |
7 | 13054402352410 |
oct | 2023117657224 |
9 | 441345488254 |
10 | 140010020500 |
11 | 54418008749 |
12 | 231750a5504 |
13 | 1028398cc9c |
14 | 6ac2ab9d40 |
15 | 3996a507ba |
hex | 20993f5e94 |
140010020500 has 96 divisors (see below), whose sum is σ = 356059162368. Its totient is φ = 47097648000.
The previous prime is 140010020497. The next prime is 140010020599. The reversal of 140010020500 is 5020010041.
140010020500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 31 ways as a sum of consecutive naturals, for example, 191886 + ... + 562885.
It is an arithmetic number, because the mean of its divisors is an integer number (3708949608).
Almost surely, 2140010020500 is an apocalyptic number.
140010020500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140010020500 is an abundant number, since it is smaller than the sum of its proper divisors (216049141868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140010020500 is a wasteful number, since it uses less digits than its factorization.
140010020500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754850 (or 754838 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
Adding to 140010020500 its reverse (5020010041), we get a palindrome (145030030541).
The spelling of 140010020500 in words is "one hundred forty billion, ten million, twenty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •