Base | Representation |
---|---|
bin | 111101100011111001… |
… | …0110111111101111111 |
3 | 110122020022112201020122 |
4 | 1323013302313331333 |
5 | 4131221430140221 |
6 | 140422102405155 |
7 | 12360031066052 |
oct | 1730762677577 |
9 | 418208481218 |
10 | 132201021311 |
11 | 51080037007 |
12 | 21755a307bb |
13 | c60aba2cc8 |
14 | 6581930a99 |
15 | 368b1d2eab |
hex | 1ec7cb7f7f |
132201021311 has 4 divisors (see below), whose sum is σ = 132204596400. Its totient is φ = 132197446224.
The previous prime is 132201021229. The next prime is 132201021313. The reversal of 132201021311 is 113120102231.
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-132201021311 is a prime.
It is a super-2 number, since 2×1322010213112 (a number of 23 digits) contains 22 as substring.
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 132201021311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132201021313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1731491 + ... + 1806228.
It is an arithmetic number, because the mean of its divisors is an integer number (33051149100).
Almost surely, 2132201021311 is an apocalyptic number.
132201021311 is a deficient number, since it is larger than the sum of its proper divisors (3575089).
132201021311 is an equidigital number, since it uses as much as digits as its factorization.
132201021311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3575088.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132201021311 its reverse (113120102231), we get a palindrome (245321123542).
The spelling of 132201021311 in words is "one hundred thirty-two billion, two hundred one million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •