Base | Representation |
---|---|
bin | 11110001010000110010110… |
… | …001101001111100001011101 |
3 | 122101121211011102200201120012 |
4 | 132022012112031033201131 |
5 | 114341044302202343004 |
6 | 1150031510335533005 |
7 | 36636406661503514 |
oct | 3612062615174135 |
9 | 571554142621505 |
10 | 132635405121629 |
11 | 392973a5436503 |
12 | 12a6176898a165 |
13 | 59016078b3267 |
14 | 24a783313767b |
15 | 10502407ea46e |
hex | 78a19634f85d |
132635405121629 has 2 divisors, whose sum is σ = 132635405121630. Its totient is φ = 132635405121628.
The previous prime is 132635405121539. The next prime is 132635405121641. The reversal of 132635405121629 is 926121504536231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129581841093604 + 3053564028025 = 11383402^2 + 1747445^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132635405121629 is a prime.
It is a super-2 number, since 2×1326354051216292 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132635405121649) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66317702560814 + 66317702560815.
It is an arithmetic number, because the mean of its divisors is an integer number (66317702560815).
Almost surely, 2132635405121629 is an apocalyptic number.
It is an amenable number.
132635405121629 is a deficient number, since it is larger than the sum of its proper divisors (1).
132635405121629 is an equidigital number, since it uses as much as digits as its factorization.
132635405121629 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2332800, while the sum is 50.
The spelling of 132635405121629 in words is "one hundred thirty-two trillion, six hundred thirty-five billion, four hundred five million, one hundred twenty-one thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •