Base | Representation |
---|---|
bin | 1000001010000010011… |
… | …0111000011001010100 |
3 | 111101201010220102000011 |
4 | 2002200212320121110 |
5 | 4243443134004000 |
6 | 144213151130004 |
7 | 13060432046410 |
oct | 2024046703124 |
9 | 441633812004 |
10 | 140133500500 |
11 | 54480787034 |
12 | 231aa513904 |
13 | 102a3434b86 |
14 | 6ad525dd40 |
15 | 39a27e22ba |
hex | 20a09b8654 |
140133500500 has 288 divisors, whose sum is σ = 367882953984. Its totient is φ = 45666720000.
The previous prime is 140133500453. The next prime is 140133500587. The reversal of 140133500500 is 5005331041.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 205173159 + ... + 205173841.
It is an arithmetic number, because the mean of its divisors is an integer number (1277371368).
Almost surely, 2140133500500 is an apocalyptic number.
140133500500 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 140133500500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (183941476992).
140133500500 is an abundant number, since it is smaller than the sum of its proper divisors (227749453484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140133500500 is a wasteful number, since it uses less digits than its factorization.
140133500500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 832 (or 789 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 22.
Adding to 140133500500 its reverse (5005331041), we get a palindrome (145138831541).
The spelling of 140133500500 in words is "one hundred forty billion, one hundred thirty-three million, five hundred thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •