Base | Representation |
---|---|
bin | 11110000010110000000111… |
… | …101010010111100010011001 |
3 | 122022211112220220020000222211 |
4 | 132002300013222113202121 |
5 | 114304311232111103423 |
6 | 1145003525335115121 |
7 | 36555054011516011 |
oct | 3602600752274231 |
9 | 568745826200884 |
10 | 132130502441113 |
11 | 3911225aaa1630 |
12 | 1299b939b12aa1 |
13 | 5895b11b1c2c7 |
14 | 248b216b46c41 |
15 | 104203e58610d |
hex | 782c07a97899 |
132130502441113 has 8 divisors (see below), whose sum is σ = 144142672393440. Its totient is φ = 120118383504480.
The previous prime is 132130502441111. The next prime is 132130502441143. The reversal of 132130502441113 is 311144205031231.
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 132130502441113 - 21 = 132130502441111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132130502441111) 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, 7234620 + ... + 17793277.
It is an arithmetic number, because the mean of its divisors is an integer number (18017834049180).
Almost surely, 2132130502441113 is an apocalyptic number.
It is an amenable number.
132130502441113 is a deficient number, since it is larger than the sum of its proper divisors (12012169952327).
132130502441113 is a wasteful number, since it uses less digits than its factorization.
132130502441113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25507847.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 132130502441113 its reverse (311144205031231), we get a palindrome (443274707472344).
The spelling of 132130502441113 in words is "one hundred thirty-two trillion, one hundred thirty billion, five hundred two million, four hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •