Base | Representation |
---|---|
bin | 101111000110001111… |
… | …0110011101010110000 |
3 | 100200001200212221210221 |
4 | 1132030132303222300 |
5 | 3124114112242000 |
6 | 114244045302424 |
7 | 10210241311534 |
oct | 1361436635260 |
9 | 320050787727 |
10 | 101141134000 |
11 | 39991595a55 |
12 | 17727b64a14 |
13 | 96cb06316a |
14 | 4c76829bc4 |
15 | 296e4e861a |
hex | 178c7b3ab0 |
101141134000 has 80 divisors (see below), whose sum is σ = 245063797056. Its totient is φ = 40372992000.
The previous prime is 101141133983. The next prime is 101141134013. The reversal of 101141134000 is 431141101.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 922080 + ... + 1025920.
Almost surely, 2101141134000 is an apocalyptic number.
101141134000 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 101141134000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122531898528).
101141134000 is an abundant number, since it is smaller than the sum of its proper divisors (143922663056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101141134000 is a wasteful number, since it uses less digits than its factorization.
101141134000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104351 (or 104335 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 101141134000 its reverse (431141101), we get a palindrome (101572275101).
The spelling of 101141134000 in words is "one hundred one billion, one hundred forty-one million, one hundred thirty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •