Base | Representation |
---|---|
bin | 101111010001101111… |
… | …1111100011101100100 |
3 | 100201001121112122010120 |
4 | 1132203133330131210 |
5 | 3130411442330012 |
6 | 114350242321540 |
7 | 10222640610615 |
oct | 1364337743544 |
9 | 321047478116 |
10 | 101527308132 |
11 | 3a06a578328 |
12 | 178153592b0 |
13 | 9760073673 |
14 | 4cb1c31c0c |
15 | 299337a58c |
hex | 17a37fc764 |
101527308132 has 48 divisors (see below), whose sum is σ = 250864733952. Its totient is φ = 31847569920.
The previous prime is 101527308131. The next prime is 101527308143. The reversal of 101527308132 is 231803725101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101527308093 and 101527308102.
It is not an unprimeable number, because it can be changed into a prime (101527308131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1796133 + ... + 1851795.
It is an arithmetic number, because the mean of its divisors is an integer number (5226348624).
Almost surely, 2101527308132 is an apocalyptic number.
101527308132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101527308132 is an abundant number, since it is smaller than the sum of its proper divisors (149337425820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101527308132 is a wasteful number, since it uses less digits than its factorization.
101527308132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64628 (or 64626 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 33.
The spelling of 101527308132 in words is "one hundred one billion, five hundred twenty-seven million, three hundred eight thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •