Base | Representation |
---|---|
bin | 111101101010001000… |
… | …0100011111011111001 |
3 | 110122202220000112200011 |
4 | 1323110100203323321 |
5 | 4132133443131134 |
6 | 140454532341521 |
7 | 12365150351632 |
oct | 1732420437371 |
9 | 418686015604 |
10 | 132410130169 |
11 | 51178080649 |
12 | 217b3a748a1 |
13 | c6422c9365 |
14 | 65a1604889 |
15 | 369e73b264 |
hex | 1ed4423ef9 |
132410130169 has 2 divisors, whose sum is σ = 132410130170. Its totient is φ = 132410130168.
The previous prime is 132410130121. The next prime is 132410130239. The reversal of 132410130169 is 961031014231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120395120400 + 12015009769 = 346980^2 + 109613^2 .
It is an emirp because it is prime and its reverse (961031014231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132410130169 - 211 = 132410128121 is a prime.
It is a super-2 number, since 2×1324101301692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132410130169.
It is not a weakly prime, because it can be changed into another prime (132410130569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66205065084 + 66205065085.
It is an arithmetic number, because the mean of its divisors is an integer number (66205065085).
Almost surely, 2132410130169 is an apocalyptic number.
It is an amenable number.
132410130169 is a deficient number, since it is larger than the sum of its proper divisors (1).
132410130169 is an equidigital number, since it uses as much as digits as its factorization.
132410130169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 132410130169 in words is "one hundred thirty-two billion, four hundred ten million, one hundred thirty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •