Base | Representation |
---|---|
bin | 111101100001010000… |
… | …0100011000111001101 |
3 | 110122000010122210022012 |
4 | 1323002200203013031 |
5 | 4131031224044323 |
6 | 140405213431005 |
7 | 12354603200252 |
oct | 1730240430715 |
9 | 418003583265 |
10 | 132112331213 |
11 | 51034a6a905 |
12 | 2173019b465 |
13 | c5c56bc365 |
14 | 6573c45429 |
15 | 3683514678 |
hex | 1ec28231cd |
132112331213 has 4 divisors (see below), whose sum is σ = 134084157120. Its totient is φ = 130140505308.
The previous prime is 132112331201. The next prime is 132112331231. The reversal of 132112331213 is 312133211231.
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.
It is a cyclic number.
It is not a de Polignac number, because 132112331213 - 212 = 132112327117 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 (132112331513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 985912853 + ... + 985912986.
It is an arithmetic number, because the mean of its divisors is an integer number (33521039280).
Almost surely, 2132112331213 is an apocalyptic number.
It is an amenable number.
132112331213 is a deficient number, since it is larger than the sum of its proper divisors (1971825907).
132112331213 is an equidigital number, since it uses as much as digits as its factorization.
132112331213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1971825906.
The product of its digits is 648, while the sum is 23.
Adding to 132112331213 its reverse (312133211231), we get a palindrome (444245542444).
The spelling of 132112331213 in words is "one hundred thirty-two billion, one hundred twelve million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •