Base | Representation |
---|---|
bin | 11110000010010100000000… |
… | …000111001010011110100101 |
3 | 122022201122222210200222011001 |
4 | 132002110000013022132211 |
5 | 114303312414104012442 |
6 | 1144542013423513301 |
7 | 36552634565513503 |
oct | 3602240007123645 |
9 | 568648883628131 |
10 | 132100311000997 |
11 | 39100477791829 |
12 | 12995b12a58831 |
13 | 589300cba9141 |
14 | 2489991107673 |
15 | 1041373c442b7 |
hex | 7825001ca7a5 |
132100311000997 has 8 divisors (see below), whose sum is σ = 133424546775840. Its totient is φ = 130776395067600.
The previous prime is 132100311000979. The next prime is 132100311001013. The reversal of 132100311000997 is 799000113001231.
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 132100311000997 - 219 = 132100310476709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132100317000997) 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, 79130143 + ... + 80782300.
It is an arithmetic number, because the mean of its divisors is an integer number (16678068346980).
Almost surely, 2132100311000997 is an apocalyptic number.
It is an amenable number.
132100311000997 is a deficient number, since it is larger than the sum of its proper divisors (1324235774843).
132100311000997 is a wasteful number, since it uses less digits than its factorization.
132100311000997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159920723.
The product of its (nonzero) digits is 10206, while the sum is 37.
The spelling of 132100311000997 in words is "one hundred thirty-two trillion, one hundred billion, three hundred eleven million, nine hundred ninety-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •