Base | Representation |
---|---|
bin | 11110000011111110010110… |
… | …010101000000010101111101 |
3 | 122100010120201212010111212211 |
4 | 132003332112111000111331 |
5 | 114312200244043032342 |
6 | 1145110300350100421 |
7 | 36564116400203323 |
oct | 3603762625002575 |
9 | 570116655114784 |
10 | 132214500361597 |
11 | 391449446a1525 |
12 | 129b40807aa711 |
13 | 58a0a0a2c8134 |
14 | 2491304853d13 |
15 | 1044308a18c17 |
hex | 783f9654057d |
132214500361597 has 2 divisors, whose sum is σ = 132214500361598. Its totient is φ = 132214500361596.
The previous prime is 132214500361591. The next prime is 132214500361667. The reversal of 132214500361597 is 795163005412231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94177048524196 + 38037451837401 = 9704486^2 + 6167451^2 .
It is a cyclic number.
It is not a de Polignac number, because 132214500361597 - 23 = 132214500361589 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132214500361597.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132214500361591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66107250180798 + 66107250180799.
It is an arithmetic number, because the mean of its divisors is an integer number (66107250180799).
Almost surely, 2132214500361597 is an apocalyptic number.
It is an amenable number.
132214500361597 is a deficient number, since it is larger than the sum of its proper divisors (1).
132214500361597 is an equidigital number, since it uses as much as digits as its factorization.
132214500361597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1360800, while the sum is 49.
The spelling of 132214500361597 in words is "one hundred thirty-two trillion, two hundred fourteen billion, five hundred million, three hundred sixty-one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •