Base | Representation |
---|---|
bin | 11111000010000110001… |
… | …101110000100100111001 |
3 | 21112212111110110121021111 |
4 | 133002012031300210321 |
5 | 234414433204020401 |
6 | 4311403230040321 |
7 | 310033466640544 |
oct | 37020615604471 |
9 | 7485443417244 |
10 | 2132555532601 |
11 | 75245900342a |
12 | 2a53786490a1 |
13 | 126139a0ca70 |
14 | 7530550385b |
15 | 3a71538ae51 |
hex | 1f086370939 |
2132555532601 has 8 divisors (see below), whose sum is σ = 2297248357320. Its totient is φ = 1967955578112.
The previous prime is 2132555532563. The next prime is 2132555532647. The reversal of 2132555532601 is 1062355552312.
It can be written as a sum of positive squares in 4 ways, for example, as 658128185001 + 1474427347600 = 811251^2 + 1214260^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2132555532601 - 213 = 2132555524409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2132555532671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23169856 + ... + 23261713.
It is an arithmetic number, because the mean of its divisors is an integer number (287156044665).
Almost surely, 22132555532601 is an apocalyptic number.
It is an amenable number.
2132555532601 is a deficient number, since it is larger than the sum of its proper divisors (164692824719).
2132555532601 is a wasteful number, since it uses less digits than its factorization.
2132555532601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46435115.
The product of its (nonzero) digits is 270000, while the sum is 40.
The spelling of 2132555532601 in words is "two trillion, one hundred thirty-two billion, five hundred fifty-five million, five hundred thirty-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •