Base | Representation |
---|---|
bin | 11110000100000011110000… |
… | …111100100011011010101011 |
3 | 122100011010202010121112212020 |
4 | 132010003300330203122223 |
5 | 114312244201301124421 |
6 | 1145113101403515523 |
7 | 36564413452252164 |
oct | 3604036074433253 |
9 | 570133663545766 |
10 | 132220315645611 |
11 | 39147359229476 |
12 | 129b5224228ba3 |
13 | 58a142602b5ab |
14 | 24916d6cdc76b |
15 | 1044549315dc6 |
hex | 7840f0f236ab |
132220315645611 has 8 divisors (see below), whose sum is σ = 182372849166480. Its totient is φ = 85107329610912.
The previous prime is 132220315645601. The next prime is 132220315645619. The reversal of 132220315645611 is 116546513022231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132220315645611 - 213 = 132220315637419 is a prime.
It is not an unprimeable number, because it can be changed into a prime (132220315645619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 759886871440 + ... + 759886871613.
It is an arithmetic number, because the mean of its divisors is an integer number (22796606145810).
Almost surely, 2132220315645611 is an apocalyptic number.
132220315645611 is a deficient number, since it is larger than the sum of its proper divisors (50152533520869).
132220315645611 is a wasteful number, since it uses less digits than its factorization.
132220315645611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1519773743085.
The product of its (nonzero) digits is 259200, while the sum is 42.
Adding to 132220315645611 its reverse (116546513022231), we get a palindrome (248766828667842).
The spelling of 132220315645611 in words is "one hundred thirty-two trillion, two hundred twenty billion, three hundred fifteen million, six hundred forty-five thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •