Base | Representation |
---|---|
bin | 11110000010110010011110… |
… | …011011111111001111101101 |
3 | 122022211210110012002112021001 |
4 | 132002302132123333033231 |
5 | 114304331422144444323 |
6 | 1145005024341040301 |
7 | 36555203465625163 |
oct | 3602623633771755 |
9 | 568753405075231 |
10 | 132133032031213 |
11 | 39113338976064 |
12 | 129a03250b6091 |
13 | 5896125c0bc95 |
14 | 248b3b6a9b233 |
15 | 104213b6a93ad |
hex | 782c9e6ff3ed |
132133032031213 has 8 divisors (see below), whose sum is σ = 132943960661408. Its totient is φ = 131322107017584.
The previous prime is 132133032031207. The next prime is 132133032031249. The reversal of 132133032031213 is 312130230331231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132133032031213 - 25 = 132133032031181 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 (132133032031283) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 133534306 + ... + 134520172.
It is an arithmetic number, because the mean of its divisors is an integer number (16617995082676).
Almost surely, 2132133032031213 is an apocalyptic number.
It is an amenable number.
132133032031213 is a deficient number, since it is larger than the sum of its proper divisors (810928630195).
132133032031213 is an equidigital number, since it uses as much as digits as its factorization.
132133032031213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1808283.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 132133032031213 its reverse (312130230331231), we get a palindrome (444263262362444).
The spelling of 132133032031213 in words is "one hundred thirty-two trillion, one hundred thirty-three billion, thirty-two million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •