Base | Representation |
---|---|
bin | 11110000101101100110011… |
… | …001011111100100011110101 |
3 | 122100112220211222222121020201 |
4 | 132011230303023330203311 |
5 | 114321121140102023314 |
6 | 1145240552441000501 |
7 | 36605515325444422 |
oct | 3605546313744365 |
9 | 570486758877221 |
10 | 132333096126709 |
11 | 39190172935145 |
12 | 12a1305a183131 |
13 | 58abc5a5b028a |
14 | 2496d554a4d49 |
15 | 104744a58eb74 |
hex | 785b332fc8f5 |
132333096126709 has 2 divisors, whose sum is σ = 132333096126710. Its totient is φ = 132333096126708.
The previous prime is 132333096126691. The next prime is 132333096126797. The reversal of 132333096126709 is 907621690333231.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87320670769809 + 45012425356900 = 9344553^2 + 6709130^2 .
It is a cyclic number.
It is not a de Polignac number, because 132333096126709 - 25 = 132333096126677 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132333096126709.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132333096126799) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66166548063354 + 66166548063355.
It is an arithmetic number, because the mean of its divisors is an integer number (66166548063355).
Almost surely, 2132333096126709 is an apocalyptic number.
It is an amenable number.
132333096126709 is a deficient number, since it is larger than the sum of its proper divisors (1).
132333096126709 is an equidigital number, since it uses as much as digits as its factorization.
132333096126709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6613488, while the sum is 55.
The spelling of 132333096126709 in words is "one hundred thirty-two trillion, three hundred thirty-three billion, ninety-six million, one hundred twenty-six thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •