Base | Representation |
---|---|
bin | 11110000100000100011111… |
… | …110001101101101000010101 |
3 | 122100011012202220000121100122 |
4 | 132010010133301231220111 |
5 | 114312302303420124023 |
6 | 1145113311351521325 |
7 | 36564442102425050 |
oct | 3604043761555025 |
9 | 570135686017318 |
10 | 132221101333013 |
11 | 39147721784000 |
12 | 129b5403389245 |
13 | 58a151ca3c994 |
14 | 249176d3bda97 |
15 | 10445932b22c8 |
hex | 78411fc6da15 |
132221101333013 has 64 divisors (see below), whose sum is σ = 169845431648256. Its totient is φ = 100778147395200.
The previous prime is 132221101333007. The next prime is 132221101333043. The reversal of 132221101333013 is 310333101122231.
It is not a de Polignac number, because 132221101333013 - 26 = 132221101332949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132221101333043) 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 63 ways as a sum of consecutive naturals, for example, 753536456 + ... + 753711902.
It is an arithmetic number, because the mean of its divisors is an integer number (2653834869504).
Almost surely, 2132221101333013 is an apocalyptic number.
It is an amenable number.
132221101333013 is a deficient number, since it is larger than the sum of its proper divisors (37624330315243).
132221101333013 is a wasteful number, since it uses less digits than its factorization.
132221101333013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177255 (or 177233 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 132221101333013 its reverse (310333101122231), we get a palindrome (442554202455244).
The spelling of 132221101333013 in words is "one hundred thirty-two trillion, two hundred twenty-one billion, one hundred one million, three hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •