Base | Representation |
---|---|
bin | 111101100100011101… |
… | …1101100010111100111 |
3 | 110122021122110112102122 |
4 | 1323020323230113213 |
5 | 4131241322012221 |
6 | 140424023500155 |
7 | 12360352252112 |
oct | 1731073542747 |
9 | 418248415378 |
10 | 132220110311 |
11 | 5108a894943 |
12 | 217602b765b |
13 | c611b27883 |
14 | 658429d579 |
15 | 368cc03eab |
hex | 1ec8eec5e7 |
132220110311 has 4 divisors (see below), whose sum is σ = 132225871824. Its totient is φ = 132214348800.
The previous prime is 132220110301. The next prime is 132220110329. The reversal of 132220110311 is 113011022231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132220110311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132220110311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132220110301) 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 3 ways as a sum of consecutive naturals, for example, 2846195 + ... + 2892276.
It is an arithmetic number, because the mean of its divisors is an integer number (33056467956).
Almost surely, 2132220110311 is an apocalyptic number.
132220110311 is a deficient number, since it is larger than the sum of its proper divisors (5761513).
132220110311 is an equidigital number, since it uses as much as digits as its factorization.
132220110311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5761512.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132220110311 its reverse (113011022231), we get a palindrome (245231132542).
The spelling of 132220110311 in words is "one hundred thirty-two billion, two hundred twenty million, one hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •