Base | Representation |
---|---|
bin | 11110000100000000010010… |
… | …000001100111001110001111 |
3 | 122100010210002111011020011011 |
4 | 132010000102001213032033 |
5 | 114312214021331342001 |
6 | 1145111242322510051 |
7 | 36564221666660002 |
oct | 3604002201471617 |
9 | 570123074136134 |
10 | 132216575652751 |
11 | 3914580a093487 |
12 | 129b455b805327 |
13 | 58a0c7b244475 |
14 | 249146030b539 |
15 | 10443caceed51 |
hex | 78401206738f |
132216575652751 has 8 divisors (see below), whose sum is σ = 133810185519360. Its totient is φ = 130622981002392.
The previous prime is 132216575652743. The next prime is 132216575652757. The reversal of 132216575652751 is 157256575612231.
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 132216575652751 - 23 = 132216575652743 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 (132216575652757) 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, 14188810 + ... + 21581368.
It is an arithmetic number, because the mean of its divisors is an integer number (16726273189920).
Almost surely, 2132216575652751 is an apocalyptic number.
132216575652751 is a deficient number, since it is larger than the sum of its proper divisors (1593609866609).
132216575652751 is an equidigital number, since it uses as much as digits as its factorization.
132216575652751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7608125.
The product of its digits is 26460000, while the sum is 58.
The spelling of 132216575652751 in words is "one hundred thirty-two trillion, two hundred sixteen billion, five hundred seventy-five million, six hundred fifty-two thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •