Base | Representation |
---|---|
bin | 111101100000010101… |
… | …0111010100101100101 |
3 | 110121220222122010010000 |
4 | 1323000222322211211 |
5 | 4131000330304443 |
6 | 140402152451513 |
7 | 12354050115033 |
oct | 1730052724545 |
9 | 417828563100 |
10 | 132081494373 |
11 | 51019618714 |
12 | 217219a9b99 |
13 | c5bc1b34ca |
14 | 656dad9553 |
15 | 36809728d3 |
hex | 1ec0aba965 |
132081494373 has 20 divisors (see below), whose sum is σ = 208913215500. Its totient is φ = 82874662272.
The previous prime is 132081494317. The next prime is 132081494417. The reversal of 132081494373 is 373494180231.
132081494373 is a `hidden beast` number, since 1 + 3 + 208 + 1 + 4 + 9 + 437 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 123466498884 + 8614995489 = 351378^2 + 92817^2 .
It is not a de Polignac number, because 132081494373 - 29 = 132081493861 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132081495373) 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 19 ways as a sum of consecutive naturals, for example, 47958498 + ... + 47961251.
It is an arithmetic number, because the mean of its divisors is an integer number (10445660775).
Almost surely, 2132081494373 is an apocalyptic number.
It is an amenable number.
132081494373 is a deficient number, since it is larger than the sum of its proper divisors (76831721127).
132081494373 is an equidigital number, since it uses as much as digits as its factorization.
132081494373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95919778 (or 95919769 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 45.
The spelling of 132081494373 in words is "one hundred thirty-two billion, eighty-one million, four hundred ninety-four thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •