Base | Representation |
---|---|
bin | 111101100110111000… |
… | …1011111101111001101 |
3 | 110122111022021120120220 |
4 | 1323031301133233031 |
5 | 4131423114320323 |
6 | 140440044301553 |
7 | 12362356456323 |
oct | 1731561375715 |
9 | 418438246526 |
10 | 132301323213 |
11 | 51121714344 |
12 | 217835418b9 |
13 | c6258c1047 |
14 | 6590d9dd13 |
15 | 3694de70e3 |
hex | 1ecdc5fbcd |
132301323213 has 4 divisors (see below), whose sum is σ = 176401764288. Its totient is φ = 88200882140.
The previous prime is 132301323157. The next prime is 132301323223. The reversal of 132301323213 is 312323103231.
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: 312323103231 = 3 ⋅104107701077.
It is a cyclic number.
It is not a de Polignac number, because 132301323213 - 28 = 132301322957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132301323223) 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, 22050220533 + ... + 22050220538.
It is an arithmetic number, because the mean of its divisors is an integer number (44100441072).
Almost surely, 2132301323213 is an apocalyptic number.
It is an amenable number.
132301323213 is a deficient number, since it is larger than the sum of its proper divisors (44100441075).
132301323213 is an equidigital number, since it uses as much as digits as its factorization.
132301323213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44100441074.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 132301323213 its reverse (312323103231), we get a palindrome (444624426444).
The spelling of 132301323213 in words is "one hundred thirty-two billion, three hundred one million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •