Base | Representation |
---|---|
bin | 10011001101000011… |
… | …000011101110001100 |
3 | 1222020001011112112220 |
4 | 103031003003232030 |
5 | 314212210001030 |
6 | 13250034055340 |
7 | 1326661052325 |
oct | 231503035614 |
9 | 58201145486 |
10 | 20620000140 |
11 | 88214a8333 |
12 | 3bb571a550 |
13 | 1c37c86a1c |
14 | dd879744c |
15 | 80a3d9a10 |
hex | 4cd0c3b8c |
20620000140 has 96 divisors (see below), whose sum is σ = 58531092480. Its totient is φ = 5423099136.
The previous prime is 20620000091. The next prime is 20620000151. The reversal of 20620000140 is 4100002602.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 5795242 + ... + 5798798.
It is an arithmetic number, because the mean of its divisors is an integer number (609698880).
Almost surely, 220620000140 is an apocalyptic number.
20620000140 is a gapful number since it is divisible by the number (20) 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 20620000140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29265546240).
20620000140 is an abundant number, since it is smaller than the sum of its proper divisors (37911092340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20620000140 is a wasteful number, since it uses less digits than its factorization.
20620000140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4871 (or 4869 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 20620000140 its reverse (4100002602), we get a palindrome (24720002742).
The spelling of 20620000140 in words is "twenty billion, six hundred twenty million, one hundred forty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •