Base | Representation |
---|---|
bin | 101110101011001000… |
… | …0000110111100011100 |
3 | 100120201021220011110200 |
4 | 1131112100012330130 |
5 | 3120233203424012 |
6 | 114013504503500 |
7 | 10145553041661 |
oct | 1352620067434 |
9 | 316637804420 |
10 | 100231311132 |
11 | 39564a64627 |
12 | 1751331ab90 |
13 | 95b470a734 |
14 | 4bcba73a68 |
15 | 29196cb3dc |
hex | 1756406f1c |
100231311132 has 144 divisors (see below), whose sum is σ = 268553725440. Its totient is φ = 31465977984.
The previous prime is 100231311127. The next prime is 100231311151. The reversal of 100231311132 is 231113132001.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 64957953 + ... + 64959495.
Almost surely, 2100231311132 is an apocalyptic number.
100231311132 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 100231311132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134276862720).
100231311132 is an abundant number, since it is smaller than the sum of its proper divisors (168322414308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100231311132 is a wasteful number, since it uses less digits than its factorization.
100231311132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3072 (or 3067 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 100231311132 its reverse (231113132001), we get a palindrome (331344443133).
The spelling of 100231311132 in words is "one hundred billion, two hundred thirty-one million, three hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •