Base | Representation |
---|---|
bin | 11110000000110110110010… |
… | …111001011110111011011111 |
3 | 122022101002200002010110220212 |
4 | 132000312302321132323133 |
5 | 114300142433204240221 |
6 | 1144424022533003035 |
7 | 36542462533334633 |
oct | 3600666271367337 |
9 | 568332602113825 |
10 | 132000231321311 |
11 | 39071a90384151 |
12 | 1297a64248347b |
13 | 5886750a1c072 |
14 | 2484bb9664dc3 |
15 | 103d967a1ab5b |
hex | 780db2e5eedf |
132000231321311 has 2 divisors, whose sum is σ = 132000231321312. Its totient is φ = 132000231321310.
The previous prime is 132000231321307. The next prime is 132000231321323. The reversal of 132000231321311 is 113123132000231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 132000231321311 - 22 = 132000231321307 is a prime.
It is a super-2 number, since 2×1320002313213112 (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 (132000231321811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66000115660655 + 66000115660656.
It is an arithmetic number, because the mean of its divisors is an integer number (66000115660656).
Almost surely, 2132000231321311 is an apocalyptic number.
132000231321311 is a deficient number, since it is larger than the sum of its proper divisors (1).
132000231321311 is an equidigital number, since it uses as much as digits as its factorization.
132000231321311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 132000231321311 its reverse (113123132000231), we get a palindrome (245123363321542).
The spelling of 132000231321311 in words is "one hundred thirty-two trillion, two hundred thirty-one million, three hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •