Base | Representation |
---|---|
bin | 111101100011000110… |
… | …1010101000000011001 |
3 | 110122011110110021210222 |
4 | 1323012031111000121 |
5 | 4131143121322221 |
6 | 140415312045425 |
7 | 12356255606336 |
oct | 1730615250031 |
9 | 418143407728 |
10 | 132174401561 |
11 | 51067005214 |
12 | 21748b33875 |
13 | c605512787 |
14 | 657c1a198d |
15 | 3688bc59ab |
hex | 1ec6355019 |
132174401561 has 2 divisors, whose sum is σ = 132174401562. Its totient is φ = 132174401560.
The previous prime is 132174401479. The next prime is 132174401573. The reversal of 132174401561 is 165104471231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131800945936 + 373455625 = 363044^2 + 19325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132174401561 is a prime.
It is not a weakly prime, because it can be changed into another prime (132174401861) 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 as a sum of consecutive naturals, namely, 66087200780 + 66087200781.
It is an arithmetic number, because the mean of its divisors is an integer number (66087200781).
Almost surely, 2132174401561 is an apocalyptic number.
It is an amenable number.
132174401561 is a deficient number, since it is larger than the sum of its proper divisors (1).
132174401561 is an equidigital number, since it uses as much as digits as its factorization.
132174401561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 35.
Adding to 132174401561 its reverse (165104471231), we get a palindrome (297278872792).
The spelling of 132174401561 in words is "one hundred thirty-two billion, one hundred seventy-four million, four hundred one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •