Base | Representation |
---|---|
bin | 101111001010111111… |
… | …0000011111101010100 |
3 | 100200110210102112212200 |
4 | 1132111332003331110 |
5 | 3124430340302012 |
6 | 114311533244500 |
7 | 10214213350062 |
oct | 1362576037524 |
9 | 320423375780 |
10 | 101300322132 |
11 | 39a63433399 |
12 | 17771333730 |
13 | 972502b219 |
14 | 4c8da27032 |
15 | 297d4903dc |
hex | 1795f83f54 |
101300322132 has 36 divisors (see below), whose sum is σ = 256898818176. Its totient is φ = 33656780880.
The previous prime is 101300322121. The next prime is 101300322133. The reversal of 101300322132 is 231223003101.
101300322132 is a `hidden beast` number, since 10 + 1 + 300 + 322 + 1 + 32 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101300322133) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4571844 + ... + 4593947.
Almost surely, 2101300322132 is an apocalyptic number.
101300322132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101300322132 is an abundant number, since it is smaller than the sum of its proper divisors (155598496044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101300322132 is a wasteful number, since it uses less digits than its factorization.
101300322132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9166108 (or 9166103 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 101300322132 its reverse (231223003101), we get a palindrome (332523325233).
The spelling of 101300322132 in words is "one hundred one billion, three hundred million, three hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •