Base | Representation |
---|---|
bin | 11110001010100001011100… |
… | …100001110011111101111111 |
3 | 122101201121021020222210000010 |
4 | 132022201130201303331333 |
5 | 114342033400031100320 |
6 | 1150053121515234303 |
7 | 36641460015602331 |
oct | 3612413441637577 |
9 | 571647236883003 |
10 | 132664502206335 |
11 | 392a8776a36950 |
12 | 12a67329448993 |
13 | 5904293ba0a48 |
14 | 24a8dd36a7451 |
15 | 1050d9501dae0 |
hex | 78a85c873f7f |
132664502206335 has 128 divisors (see below), whose sum is σ = 242060296320000. Its totient is φ = 61452711936000.
The previous prime is 132664502206331. The next prime is 132664502206339. The reversal of 132664502206335 is 533602205466231.
It is an interprime number because it is at equal distance from previous prime (132664502206331) and next prime (132664502206339).
It is not a de Polignac number, because 132664502206335 - 22 = 132664502206331 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132664502206331) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 821020431 + ... + 821181999.
It is an arithmetic number, because the mean of its divisors is an integer number (1891096065000).
Almost surely, 2132664502206335 is an apocalyptic number.
132664502206335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
132664502206335 is a deficient number, since it is larger than the sum of its proper divisors (109395794113665).
132664502206335 is a wasteful number, since it uses less digits than its factorization.
132664502206335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163417.
The product of its (nonzero) digits is 4665600, while the sum is 48.
The spelling of 132664502206335 in words is "one hundred thirty-two trillion, six hundred sixty-four billion, five hundred two million, two hundred six thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •