Base | Representation |
---|---|
bin | 11101111011100000010110… |
… | …010010011010001000101001 |
3 | 122021001221120110020220012001 |
4 | 131323200112102122020221 |
5 | 114223131411043042301 |
6 | 1143543052240051001 |
7 | 36504064562355124 |
oct | 3573402622321051 |
9 | 567057513226161 |
10 | 131632531612201 |
11 | 38a40052495434 |
12 | 1291b324603a61 |
13 | 585ab821c04a9 |
14 | 24710972133bb |
15 | 10340e6b78c01 |
hex | 77b81649a229 |
131632531612201 has 2 divisors, whose sum is σ = 131632531612202. Its totient is φ = 131632531612200.
The previous prime is 131632531612199. The next prime is 131632531612207. The reversal of 131632531612201 is 102216135236131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71653702452201 + 59978829160000 = 8464851^2 + 7744600^2 .
It is a cyclic number.
It is not a de Polignac number, because 131632531612201 - 21 = 131632531612199 is a prime.
Together with 131632531612199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (131632531612207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65816265806100 + 65816265806101.
It is an arithmetic number, because the mean of its divisors is an integer number (65816265806101).
Almost surely, 2131632531612201 is an apocalyptic number.
It is an amenable number.
131632531612201 is a deficient number, since it is larger than the sum of its proper divisors (1).
131632531612201 is an equidigital number, since it uses as much as digits as its factorization.
131632531612201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880, while the sum is 37.
Adding to 131632531612201 its reverse (102216135236131), we get a palindrome (233848666848332).
The spelling of 131632531612201 in words is "one hundred thirty-one trillion, six hundred thirty-two billion, five hundred thirty-one million, six hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •