Base | Representation |
---|---|
bin | 1000001011011011000… |
… | …1111101111011011100 |
3 | 111102200001220012221010 |
4 | 2002312301331323130 |
5 | 4300223402134000 |
6 | 144314120335220 |
7 | 13102600043163 |
oct | 2026661757334 |
9 | 442601805833 |
10 | 140505505500 |
11 | 54651770988 |
12 | 23293014510 |
13 | 10332523c89 |
14 | 6b2c8183da |
15 | 39c52c5d50 |
hex | 20b6c7dedc |
140505505500 has 96 divisors (see below), whose sum is σ = 410663006208. Its totient is φ = 37329768000.
The previous prime is 140505505487. The next prime is 140505505531. The reversal of 140505505500 is 5505505041.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 233677 + ... + 579323.
It is an arithmetic number, because the mean of its divisors is an integer number (4277739648).
Almost surely, 2140505505500 is an apocalyptic number.
140505505500 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 140505505500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205331503104).
140505505500 is an abundant number, since it is smaller than the sum of its proper divisors (270157500708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140505505500 is a wasteful number, since it uses less digits than its factorization.
140505505500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 345940 (or 345928 counting only the distinct ones).
The product of its (nonzero) digits is 12500, while the sum is 30.
The spelling of 140505505500 in words is "one hundred forty billion, five hundred five million, five hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •