Base | Representation |
---|---|
bin | 111101001001000110… |
… | …1111001010101110000 |
3 | 110112220200010120020200 |
4 | 1322102031321111300 |
5 | 4122401321311102 |
6 | 140152552235200 |
7 | 12325534506516 |
oct | 1722215712560 |
9 | 415820116220 |
10 | 131302135152 |
11 | 507596a5591 |
12 | 2154499bb00 |
13 | c4c68a95c6 |
14 | 64d83c44b6 |
15 | 363732651c |
hex | 1e92379570 |
131302135152 has 60 divisors (see below), whose sum is σ = 367525409160. Its totient is φ = 43760018304.
The previous prime is 131302135147. The next prime is 131302135183. The reversal of 131302135152 is 251531203131.
131302135152 is a `hidden beast` number, since 1 + 3 + 1 + 302 + 1 + 351 + 5 + 2 = 666.
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 11 ways as a sum of consecutive naturals, for example, 818799 + ... + 965937.
It is an arithmetic number, because the mean of its divisors is an integer number (6125423486).
Almost surely, 2131302135152 is an apocalyptic number.
131302135152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131302135152 is an abundant number, since it is smaller than the sum of its proper divisors (236223274008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131302135152 is a wasteful number, since it uses less digits than its factorization.
131302135152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153350 (or 153341 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 131302135152 its reverse (251531203131), we get a palindrome (382833338283).
The spelling of 131302135152 in words is "one hundred thirty-one billion, three hundred two million, one hundred thirty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •