Base | Representation |
---|---|
bin | 111101001010001111… |
… | …0011101000010110100 |
3 | 110120000022102211101110 |
4 | 1322110132131002310 |
5 | 4122441021431012 |
6 | 140200424355020 |
7 | 12326504556513 |
oct | 1722436350264 |
9 | 416008384343 |
10 | 131340030132 |
11 | 50779028653 |
12 | 21555615a70 |
13 | c5016b6c7c |
14 | 64dd44a67a |
15 | 363a80e73c |
hex | 1e9479d0b4 |
131340030132 has 48 divisors (see below), whose sum is σ = 307015732800. Its totient is φ = 43700702208.
The previous prime is 131340030127. The next prime is 131340030161. The reversal of 131340030132 is 231030043131.
It is a junction number, because it is equal to n+sod(n) for n = 131340030099 and 131340030108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21482308 + ... + 21488420.
It is an arithmetic number, because the mean of its divisors is an integer number (6396161100).
Almost surely, 2131340030132 is an apocalyptic number.
131340030132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131340030132 is an abundant number, since it is smaller than the sum of its proper divisors (175675702668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131340030132 is a wasteful number, since it uses less digits than its factorization.
131340030132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9072 (or 9070 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 131340030132 its reverse (231030043131), we get a palindrome (362370073263).
The spelling of 131340030132 in words is "one hundred thirty-one billion, three hundred forty million, thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •