Base | Representation |
---|---|
bin | 10110111111011111011100… |
… | …001111100010110100000000 |
3 | 111021000222200100002211112102 |
4 | 112333133130033202310000 |
5 | 101223222441142041000 |
6 | 555021534241445532 |
7 | 30204454411043030 |
oct | 2677373417426400 |
9 | 437028610084472 |
10 | 101120110112000 |
11 | 2a246885a64a41 |
12 | b4119083408a8 |
13 | 445677c370175 |
14 | 1ad834d0658c0 |
15 | ba55759dc3d5 |
hex | 5bf7dc3e2d00 |
101120110112000 has 288 divisors, whose sum is σ = 287952920795904. Its totient is φ = 34662048768000.
The previous prime is 101120110111991. The next prime is 101120110112071. The reversal of 101120110112000 is 211011021101.
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, 1057904210 + ... + 1057999790.
Almost surely, 2101120110112000 is an apocalyptic number.
101120110112000 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 101120110112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143976460397952).
101120110112000 is an abundant number, since it is smaller than the sum of its proper divisors (186832810683904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120110112000 is an frugal number, since it uses more digits than its factorization.
101120110112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100342 (or 100318 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101120110112000 its reverse (211011021101), we get a palindrome (101331121133101).
The spelling of 101120110112000 in words is "one hundred one trillion, one hundred twenty billion, one hundred ten million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •