Base | Representation |
---|---|
bin | 1110100111000111010111… |
… | …10101110010011101100001 |
3 | 11012202121221200210012102222 |
4 | 13103203223311302131201 |
5 | 13202410334400321121 |
6 | 152200243413120425 |
7 | 6524224041551033 |
oct | 723435365623541 |
9 | 135677850705388 |
10 | 32130312120161 |
11 | a268430613512 |
12 | 372b0a0629115 |
13 | 14c0b4c42a818 |
14 | 7d1188951c53 |
15 | 3aabb32200ab |
hex | 1d38ebd72761 |
32130312120161 has 2 divisors, whose sum is σ = 32130312120162. Its totient is φ = 32130312120160.
The previous prime is 32130312120103. The next prime is 32130312120197. The reversal of 32130312120161 is 16102121303123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31255982397025 + 874329723136 = 5590705^2 + 935056^2 .
It is a cyclic number.
It is not a de Polignac number, because 32130312120161 - 230 = 32129238378337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 32130312120161.
It is not a weakly prime, because it can be changed into another prime (32130312120661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16065156060080 + 16065156060081.
It is an arithmetic number, because the mean of its divisors is an integer number (16065156060081).
Almost surely, 232130312120161 is an apocalyptic number.
It is an amenable number.
32130312120161 is a deficient number, since it is larger than the sum of its proper divisors (1).
32130312120161 is an equidigital number, since it uses as much as digits as its factorization.
32130312120161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 32130312120161 its reverse (16102121303123), we get a palindrome (48232433423284).
The spelling of 32130312120161 in words is "thirty-two trillion, one hundred thirty billion, three hundred twelve million, one hundred twenty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •