Base | Representation |
---|---|
bin | 111101001101100100… |
… | …1111001101110111100 |
3 | 110120022010021201012120 |
4 | 1322123021321232330 |
5 | 4123203213130012 |
6 | 140215510202540 |
7 | 12332335161606 |
oct | 1723311715674 |
9 | 416263251176 |
10 | 131452083132 |
11 | 50826301737 |
12 | 21587053450 |
13 | c51b98a916 |
14 | 6510298176 |
15 | 364559558c |
hex | 1e9b279bbc |
131452083132 has 24 divisors (see below), whose sum is σ = 306744440016. Its totient is φ = 43814087808.
The previous prime is 131452083107. The next prime is 131452083157. The reversal of 131452083132 is 231380254131.
It is an interprime number because it is at equal distance from previous prime (131452083107) and next prime (131452083157).
It is a junction number, because it is equal to n+sod(n) for n = 131452083093 and 131452083102.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 238993 + ... + 565704.
It is an arithmetic number, because the mean of its divisors is an integer number (12781018334).
Almost surely, 2131452083132 is an apocalyptic number.
131452083132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131452083132 is an abundant number, since it is smaller than the sum of its proper divisors (175292356884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131452083132 is a wasteful number, since it uses less digits than its factorization.
131452083132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 818317 (or 818315 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 131452083132 in words is "one hundred thirty-one billion, four hundred fifty-two million, eighty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •