Base | Representation |
---|---|
bin | 101111001101111110… |
… | …1000011001010000000 |
3 | 100200201210100021212020 |
4 | 1132123331003022000 |
5 | 3130132041020000 |
6 | 114325521201440 |
7 | 10216542620166 |
oct | 1363375031200 |
9 | 320653307766 |
10 | 101400720000 |
11 | 3a005076838 |
12 | 1779aa90280 |
13 | 973ca80b48 |
14 | 4c9d0bd236 |
15 | 29871c2ba0 |
hex | 179bf43280 |
101400720000 has 640 divisors, whose sum is σ = 364469582400. Its totient is φ = 24883200000.
The previous prime is 101400719971. The next prime is 101400720059. The reversal of 101400720000 is 27004101.
It is a tau number, because it is divible by the number of its divisors (640).
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 79 ways as a sum of consecutive naturals, for example, 168719700 + ... + 168720300.
Almost surely, 2101400720000 is an apocalyptic number.
101400720000 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 101400720000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182234791200).
101400720000 is an abundant number, since it is smaller than the sum of its proper divisors (263068862400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101400720000 is an equidigital number, since it uses as much as digits as its factorization.
101400720000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 694 (or 667 counting only the distinct ones).
The product of its (nonzero) digits is 56, while the sum is 15.
Adding to 101400720000 its reverse (27004101), we get a palindrome (101427724101).
The spelling of 101400720000 in words is "one hundred one billion, four hundred million, seven hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •