Base | Representation |
---|---|
bin | 11010001100101001000… |
… | …00110111000000000000 |
3 | 10012001102021212000000000 |
4 | 31012110200313000000 |
5 | 104221441242303340 |
6 | 1525304000000000 |
7 | 122014206054210 |
oct | 15062440670000 |
9 | 3161367760000 |
10 | 900139806720 |
11 | 3178244aa740 |
12 | 126553000000 |
13 | 66b6272948b |
14 | 317d1bba240 |
15 | 18634945d30 |
hex | d194837000 |
900139806720 has 2080 divisors, whose sum is σ = 4178841131520. Its totient is φ = 180592312320.
The previous prime is 900139806677. The next prime is 900139806733. The reversal of 900139806720 is 27608931009.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 31039303666 + ... + 31039303694.
Almost surely, 2900139806720 is an apocalyptic number.
900139806720 is a gapful number since it is divisible by the number (90) 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 900139806720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2089420565760).
900139806720 is an abundant number, since it is smaller than the sum of its proper divisors (3278701324800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
900139806720 is an frugal number, since it uses more digits than its factorization.
900139806720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103 (or 57 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 45.
The spelling of 900139806720 in words is "nine hundred billion, one hundred thirty-nine million, eight hundred six thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •