Base | Representation |
---|---|
bin | 111101100001110110… |
… | …0101110010011101101 |
3 | 110122001112020022100101 |
4 | 1323003230232103231 |
5 | 4131101332100023 |
6 | 140411205431101 |
7 | 12355235006320 |
oct | 1730354562355 |
9 | 418045208311 |
10 | 132132300013 |
11 | 5104526974a |
12 | 21736a0b491 |
13 | c5c989150c |
14 | 65767627b7 |
15 | 368515b1ad |
hex | 1ec3b2e4ed |
132132300013 has 4 divisors (see below), whose sum is σ = 151008342880. Its totient is φ = 113256257148.
The previous prime is 132132299969. The next prime is 132132300037. The reversal of 132132300013 is 310003231231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310003231231 = 11173 ⋅27745747.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132132300013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132132300613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9438021423 + ... + 9438021436.
It is an arithmetic number, because the mean of its divisors is an integer number (37752085720).
Almost surely, 2132132300013 is an apocalyptic number.
It is an amenable number.
132132300013 is a deficient number, since it is larger than the sum of its proper divisors (18876042867).
132132300013 is an equidigital number, since it uses as much as digits as its factorization.
132132300013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18876042866.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 132132300013 its reverse (310003231231), we get a palindrome (442135531244).
The spelling of 132132300013 in words is "one hundred thirty-two billion, one hundred thirty-two million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •