Base | Representation |
---|---|
bin | 11110000010011101111111… |
… | …001001110010100001110001 |
3 | 122022202200122222202221010111 |
4 | 132002131333021302201301 |
5 | 114304001343234032403 |
6 | 1144550545335101321 |
7 | 36553464352353466 |
oct | 3602357711624161 |
9 | 568680588687114 |
10 | 132111032330353 |
11 | 39104a796941aa |
12 | 12998005511841 |
13 | 589402b1631cb |
14 | 248a2cad9766d |
15 | 10417a00d956d |
hex | 78277f272871 |
132111032330353 has 8 divisors (see below), whose sum is σ = 132393651655680. Its totient is φ = 131828441395200.
The previous prime is 132111032330227. The next prime is 132111032330363. The reversal of 132111032330353 is 353033230111231.
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 132111032330353 - 213 = 132111032322161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132111032330363) 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, 2232328 + ... + 16407478.
It is an arithmetic number, because the mean of its divisors is an integer number (16549206456960).
Almost surely, 2132111032330353 is an apocalyptic number.
It is an amenable number.
132111032330353 is a deficient number, since it is larger than the sum of its proper divisors (282619325327).
132111032330353 is a wasteful number, since it uses less digits than its factorization.
132111032330353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14195087.
The product of its (nonzero) digits is 14580, while the sum is 31.
Adding to 132111032330353 its reverse (353033230111231), we get a palindrome (485144262441584).
The spelling of 132111032330353 in words is "one hundred thirty-two trillion, one hundred eleven billion, thirty-two million, three hundred thirty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •