Base | Representation |
---|---|
bin | 1110100111001110100000… |
… | …00100010011110111110101 |
3 | 11012202222211112202011121112 |
4 | 13103213100010103313311 |
5 | 13202441210112213102 |
6 | 152202115354124405 |
7 | 6524420654612462 |
oct | 723472004236765 |
9 | 135688745664545 |
10 | 32134141132277 |
11 | a26a015a2aa38 |
12 | 372b98aa20705 |
13 | 14c130c7b2372 |
14 | 7d142d2b6669 |
15 | 3aad3946c252 |
hex | 1d39d0113df5 |
32134141132277 has 2 divisors, whose sum is σ = 32134141132278. Its totient is φ = 32134141132276.
The previous prime is 32134141132243. The next prime is 32134141132279. The reversal of 32134141132277 is 77223114143123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26239534982116 + 5894606150161 = 5122454^2 + 2427881^2 .
It is a cyclic number.
It is not a de Polignac number, because 32134141132277 - 212 = 32134141128181 is a prime.
It is a super-2 number, since 2×321341411322772 (a number of 28 digits) contains 22 as substring.
Together with 32134141132279, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32134141132279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16067070566138 + 16067070566139.
It is an arithmetic number, because the mean of its divisors is an integer number (16067070566139).
Almost surely, 232134141132277 is an apocalyptic number.
It is an amenable number.
32134141132277 is a deficient number, since it is larger than the sum of its proper divisors (1).
32134141132277 is an equidigital number, since it uses as much as digits as its factorization.
32134141132277 is an evil number, because the sum of its binary digits is even.
The product of its digits is 169344, while the sum is 41.
The spelling of 32134141132277 in words is "thirty-two trillion, one hundred thirty-four billion, one hundred forty-one million, one hundred thirty-two thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •