Base | Representation |
---|---|
bin | 11110000101001110001110… |
… | …111101100100111101110101 |
3 | 122100102210010201100210112111 |
4 | 132011032032331210331311 |
5 | 114320101431142004212 |
6 | 1145213524030251021 |
7 | 36603244114155031 |
oct | 3605161675447565 |
9 | 570383121323474 |
10 | 132300276125557 |
11 | 391782608a2551 |
12 | 12a0881a956a71 |
13 | 58a8b29c07157 |
14 | 249552070b1c1 |
15 | 10466790c9ea7 |
hex | 78538ef64f75 |
132300276125557 has 2 divisors, whose sum is σ = 132300276125558. Its totient is φ = 132300276125556.
The previous prime is 132300276125533. The next prime is 132300276125651. The reversal of 132300276125557 is 755521672003231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89572103776516 + 42728172349041 = 9464254^2 + 6536679^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132300276125557 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132300276125557.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132300276123557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66150138062778 + 66150138062779.
It is an arithmetic number, because the mean of its divisors is an integer number (66150138062779).
Almost surely, 2132300276125557 is an apocalyptic number.
It is an amenable number.
132300276125557 is a deficient number, since it is larger than the sum of its proper divisors (1).
132300276125557 is an equidigital number, since it uses as much as digits as its factorization.
132300276125557 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2646000, while the sum is 49.
The spelling of 132300276125557 in words is "one hundred thirty-two trillion, three hundred billion, two hundred seventy-six million, one hundred twenty-five thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •