Base | Representation |
---|---|
bin | 11110000001000100001000… |
… | …000000111001111110101111 |
3 | 122022102110121120101200202202 |
4 | 132001010020000321332233 |
5 | 114300411241310413432 |
6 | 1144434351104212115 |
7 | 36543510321145406 |
oct | 3601041000717657 |
9 | 568373546350682 |
10 | 132014544232367 |
11 | 39078065675065 |
12 | 1298137790a03b |
13 | 5887bc20c95c4 |
14 | 248577651263d |
15 | 103e00435d462 |
hex | 781108039faf |
132014544232367 has 2 divisors, whose sum is σ = 132014544232368. Its totient is φ = 132014544232366.
The previous prime is 132014544232331. The next prime is 132014544232369. The reversal of 132014544232367 is 763232445410231.
It is a strong prime.
It is an emirp because it is prime and its reverse (763232445410231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132014544232367 - 212 = 132014544228271 is a prime.
Together with 132014544232369, 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 (132014544232369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66007272116183 + 66007272116184.
It is an arithmetic number, because the mean of its divisors is an integer number (66007272116184).
Almost surely, 2132014544232367 is an apocalyptic number.
132014544232367 is a deficient number, since it is larger than the sum of its proper divisors (1).
132014544232367 is an equidigital number, since it uses as much as digits as its factorization.
132014544232367 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 47.
Adding to 132014544232367 its reverse (763232445410231), we get a palindrome (895246989642598).
The spelling of 132014544232367 in words is "one hundred thirty-two trillion, fourteen billion, five hundred forty-four million, two hundred thirty-two thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •