Base | Representation |
---|---|
bin | 11110000011001101000010… |
… | …000101000111111100011101 |
3 | 122022221112001110121111210112 |
4 | 132003031002011013330131 |
5 | 114310313322102222413 |
6 | 1145030102054215405 |
7 | 36560233226511332 |
oct | 3603150205077435 |
9 | 568845043544715 |
10 | 132161547304733 |
11 | 39124441011111 |
12 | 129a5962954565 |
13 | 5898a1b7cbaab |
14 | 248c91dc5a989 |
15 | 1042c59ca42a8 |
hex | 783342147f1d |
132161547304733 has 2 divisors, whose sum is σ = 132161547304734. Its totient is φ = 132161547304732.
The previous prime is 132161547304729. The next prime is 132161547304741. The reversal of 132161547304733 is 337403745161231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117711498357049 + 14450048947684 = 10849493^2 + 3801322^2 .
It is a cyclic number.
It is not a de Polignac number, because 132161547304733 - 22 = 132161547304729 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132161547304433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66080773652366 + 66080773652367.
It is an arithmetic number, because the mean of its divisors is an integer number (66080773652367).
Almost surely, 2132161547304733 is an apocalyptic number.
It is an amenable number.
132161547304733 is a deficient number, since it is larger than the sum of its proper divisors (1).
132161547304733 is an equidigital number, since it uses as much as digits as its factorization.
132161547304733 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3810240, while the sum is 50.
The spelling of 132161547304733 in words is "one hundred thirty-two trillion, one hundred sixty-one billion, five hundred forty-seven million, three hundred four thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •