Base | Representation |
---|---|
bin | 111101100011100111… |
… | …0111000001011101111 |
3 | 110122012122210022001220 |
4 | 1323013032320023233 |
5 | 4131212021210012 |
6 | 140421124234423 |
7 | 12356554635006 |
oct | 1730716701357 |
9 | 418178708056 |
10 | 132191585007 |
11 | 51075781409 |
12 | 2175283ba13 |
13 | c608c4abb1 |
14 | 6580595c3d |
15 | 368a46c08c |
hex | 1ec73b82ef |
132191585007 has 8 divisors (see below), whose sum is σ = 176313763584. Its totient is φ = 88098564888.
The previous prime is 132191585003. The next prime is 132191585011. The reversal of 132191585007 is 700585191231.
It is an interprime number because it is at equal distance from previous prime (132191585003) and next prime (132191585011).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132191585007 - 22 = 132191585003 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132191585007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132191585003) 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 7 ways as a sum of consecutive naturals, for example, 7279033 + ... + 7297170.
It is an arithmetic number, because the mean of its divisors is an integer number (22039220448).
Almost surely, 2132191585007 is an apocalyptic number.
132191585007 is a deficient number, since it is larger than the sum of its proper divisors (44122178577).
132191585007 is a wasteful number, since it uses less digits than its factorization.
132191585007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14579229.
The product of its (nonzero) digits is 75600, while the sum is 42.
The spelling of 132191585007 in words is "one hundred thirty-two billion, one hundred ninety-one million, five hundred eighty-five thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •