Base | Representation |
---|---|
bin | 111101100001110010… |
… | …1111010111000110011 |
3 | 110122001101212200212111 |
4 | 1323003211322320303 |
5 | 4131100403012111 |
6 | 140411103310151 |
7 | 12355213600546 |
oct | 1730345727063 |
9 | 418041780774 |
10 | 132130516531 |
11 | 510442607a2 |
12 | 217362ab357 |
13 | c5c93b87c0 |
14 | 657641a85d |
15 | 3684e07a21 |
hex | 1ec397ae33 |
132130516531 has 16 divisors (see below), whose sum is σ = 142753572864. Its totient is φ = 121573599264.
The previous prime is 132130516513. The next prime is 132130516549. The reversal of 132130516531 is 135615031231.
It is an interprime number because it is at equal distance from previous prime (132130516513) and next prime (132130516549).
It is not a de Polignac number, because 132130516531 - 215 = 132130483763 is a prime.
It is a super-2 number, since 2×1321305165312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132130516493 and 132130516502.
It is not an unprimeable number, because it can be changed into a prime (132130510531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6249480 + ... + 6270586.
It is an arithmetic number, because the mean of its divisors is an integer number (8922098304).
Almost surely, 2132130516531 is an apocalyptic number.
132130516531 is a deficient number, since it is larger than the sum of its proper divisors (10623056333).
132130516531 is a wasteful number, since it uses less digits than its factorization.
132130516531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22650.
The product of its (nonzero) digits is 8100, while the sum is 31.
Adding to 132130516531 its reverse (135615031231), we get a palindrome (267745547762).
The spelling of 132130516531 in words is "one hundred thirty-two billion, one hundred thirty million, five hundred sixteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •