Base | Representation |
---|---|
bin | 111101011110010011… |
… | …0000011001111001101 |
3 | 110121202012221211200122 |
4 | 1322330212003033031 |
5 | 4130330324011341 |
6 | 140351311034325 |
7 | 12352256631236 |
oct | 1727446031715 |
9 | 417665854618 |
10 | 132013110221 |
11 | 50a93a60693 |
12 | 21702b0b9a5 |
13 | c5aac8c305 |
14 | 65649b808d |
15 | 367996594b |
hex | 1ebc9833cd |
132013110221 has 2 divisors, whose sum is σ = 132013110222. Its totient is φ = 132013110220.
The previous prime is 132013110209. The next prime is 132013110301. The reversal of 132013110221 is 122011310231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131541134596 + 471975625 = 362686^2 + 21725^2 .
It is a cyclic number.
It is not a de Polignac number, because 132013110221 - 210 = 132013109197 is a prime.
It is a super-2 number, since 2×1320131102212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132013110221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132013110121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66006555110 + 66006555111.
It is an arithmetic number, because the mean of its divisors is an integer number (66006555111).
Almost surely, 2132013110221 is an apocalyptic number.
It is an amenable number.
132013110221 is a deficient number, since it is larger than the sum of its proper divisors (1).
132013110221 is an equidigital number, since it uses as much as digits as its factorization.
132013110221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132013110221 its reverse (122011310231), we get a palindrome (254024420452).
The spelling of 132013110221 in words is "one hundred thirty-two billion, thirteen million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •