Base | Representation |
---|---|
bin | 11110000100000011111011… |
… | …111110001001000000100001 |
3 | 122100011011020000122202211002 |
4 | 132010003323332021000201 |
5 | 114312300041124023410 |
6 | 1145113132012201345 |
7 | 36564421156401164 |
oct | 3604037376110041 |
9 | 570134200582732 |
10 | 132220500611105 |
11 | 39147443682815 |
12 | 129b5276169255 |
13 | 58a145545062a |
14 | 24917136c9adb |
15 | 104455a6a07a5 |
hex | 7840fbf89021 |
132220500611105 has 4 divisors (see below), whose sum is σ = 158664600733332. Its totient is φ = 105776400488880.
The previous prime is 132220500611053. The next prime is 132220500611117. The reversal of 132220500611105 is 501116005022231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 44006347177984 + 88214153433121 = 6633728^2 + 9392239^2 .
It is not a de Polignac number, because 132220500611105 - 212 = 132220500607009 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13222050061106 + ... + 13222050061115.
It is an arithmetic number, because the mean of its divisors is an integer number (39666150183333).
Almost surely, 2132220500611105 is an apocalyptic number.
It is an amenable number.
132220500611105 is a deficient number, since it is larger than the sum of its proper divisors (26444100122227).
132220500611105 is an equidigital number, since it uses as much as digits as its factorization.
132220500611105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26444100122226.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 132220500611105 its reverse (501116005022231), we get a palindrome (633336505633336).
The spelling of 132220500611105 in words is "one hundred thirty-two trillion, two hundred twenty billion, five hundred million, six hundred eleven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •