Base | Representation |
---|---|
bin | 111101100010111111… |
… | …0010100000000100001 |
3 | 110122011012001022022000 |
4 | 1323011332110000201 |
5 | 4131141114342223 |
6 | 140415051434213 |
7 | 12356210263365 |
oct | 1730576240041 |
9 | 418135038260 |
10 | 132170465313 |
11 | 51064866917 |
12 | 21747755969 |
13 | c604764c33 |
14 | 657b8592a5 |
15 | 3688699543 |
hex | 1ec5f94021 |
132170465313 has 16 divisors (see below), whose sum is σ = 195840331200. Its totient is φ = 88099138080.
The previous prime is 132170465311. The next prime is 132170465321. The reversal of 132170465313 is 313564071231.
132170465313 is a `hidden beast` number, since 13 + 2 + 1 + 70 + 46 + 531 + 3 = 666.
It is not a de Polignac number, because 132170465313 - 21 = 132170465311 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (132170465311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 234603 + ... + 565136.
It is an arithmetic number, because the mean of its divisors is an integer number (12240020700).
Almost surely, 2132170465313 is an apocalyptic number.
It is an amenable number.
132170465313 is a deficient number, since it is larger than the sum of its proper divisors (63669865887).
132170465313 is an equidigital number, since it uses as much as digits as its factorization.
132170465313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 805869 (or 805863 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
The spelling of 132170465313 in words is "one hundred thirty-two billion, one hundred seventy million, four hundred sixty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •