Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0011110111010111100 |
3 | 100122221220202020221220 |
4 | 1132022012132322330 |
5 | 3124023402000012 |
6 | 114240101353340 |
7 | 10206245022156 |
oct | 1361206367274 |
9 | 318856666856 |
10 | 101101203132 |
11 | 39970aa2336 |
12 | 17716708850 |
13 | 96c29c1c27 |
14 | 4c713d3ad6 |
15 | 296ac5c08c |
hex | 178a19eebc |
101101203132 has 96 divisors (see below), whose sum is σ = 260876173824. Its totient is φ = 30311424000.
The previous prime is 101101203121. The next prime is 101101203157. The reversal of 101101203132 is 231302101101.
It is a happy number.
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, 5485132 + ... + 5503532.
It is an arithmetic number, because the mean of its divisors is an integer number (2717460144).
Almost surely, 2101101203132 is an apocalyptic number.
101101203132 is a gapful number since it is divisible by the number (12) 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 101101203132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130438086912).
101101203132 is an abundant number, since it is smaller than the sum of its proper divisors (159774970692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101203132 is a wasteful number, since it uses less digits than its factorization.
101101203132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19619 (or 19617 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 101101203132 its reverse (231302101101), we get a palindrome (332403304233).
The spelling of 101101203132 in words is "one hundred one billion, one hundred one million, two hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •