Base | Representation |
---|---|
bin | 11110000101100000111001… |
… | …111111100100001111101101 |
3 | 122100111200212222122111001211 |
4 | 132011200321333210033231 |
5 | 114320414011301420023 |
6 | 1145231041320234421 |
7 | 36604554005310403 |
oct | 3605407177441755 |
9 | 570450788574054 |
10 | 132320325420013 |
11 | 3918580a130195 |
12 | 12a1069530ba11 |
13 | 58aa9a3880cb3 |
14 | 24964a3385473 |
15 | 1046e4e331a0d |
hex | 785839fe43ed |
132320325420013 has 8 divisors (see below), whose sum is σ = 132332959883360. Its totient is φ = 132307691386320.
The previous prime is 132320325419999. The next prime is 132320325420067. The reversal of 132320325420013 is 310024523023231.
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 132320325420013 - 29 = 132320325419501 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 (132320325421013) 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, 1151966578 + ... + 1152081436.
It is an arithmetic number, because the mean of its divisors is an integer number (16541619985420).
Almost surely, 2132320325420013 is an apocalyptic number.
It is an amenable number.
132320325420013 is a deficient number, since it is larger than the sum of its proper divisors (12634463347).
132320325420013 is a wasteful number, since it uses less digits than its factorization.
132320325420013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214827.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 132320325420013 its reverse (310024523023231), we get a palindrome (442344848443244).
The spelling of 132320325420013 in words is "one hundred thirty-two trillion, three hundred twenty billion, three hundred twenty-five million, four hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •