Base | Representation |
---|---|
bin | 11110000001100111011010… |
… | …110111100001111000100101 |
3 | 122022120002102200210122000121 |
4 | 132001213122313201320211 |
5 | 114302021400011132232 |
6 | 1144504015410241541 |
7 | 36546321413513554 |
oct | 3601473267417045 |
9 | 568502380718017 |
10 | 132052441505317 |
11 | 390921426a2153 |
12 | 129887935862b1 |
13 | 588b651647978 |
14 | 248752d723d9b |
15 | 103eec143ed97 |
hex | 7819dade1e25 |
132052441505317 has 8 divisors (see below), whose sum is σ = 132102703757696. Its totient is φ = 132002180351712.
The previous prime is 132052441505191. The next prime is 132052441505323. The reversal of 132052441505317 is 713505144250231.
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 132052441505317 - 219 = 132052440981029 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 (132052441545317) 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, 303787033 + ... + 304221409.
It is an arithmetic number, because the mean of its divisors is an integer number (16512837969712).
Almost surely, 2132052441505317 is an apocalyptic number.
It is an amenable number.
132052441505317 is a deficient number, since it is larger than the sum of its proper divisors (50262252379).
132052441505317 is a wasteful number, since it uses less digits than its factorization.
132052441505317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549387.
The product of its (nonzero) digits is 504000, while the sum is 43.
Adding to 132052441505317 its reverse (713505144250231), we get a palindrome (845557585755548).
The spelling of 132052441505317 in words is "one hundred thirty-two trillion, fifty-two billion, four hundred forty-one million, five hundred five thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •