Base | Representation |
---|---|
bin | 11110000010010111110101… |
… | …111001001110111001100111 |
3 | 122022202001122011212200001112 |
4 | 132002113311321032321213 |
5 | 114303344340220403411 |
6 | 1144543534525415235 |
7 | 36553142016166442 |
oct | 3602276571167147 |
9 | 568661564780045 |
10 | 132104434544231 |
11 | 391021a33878a6 |
12 | 12996883a0a51b |
13 | 5893519295456 |
14 | 2489c62a1a659 |
15 | 1041515c6eb8b |
hex | 7825f5e4ee67 |
132104434544231 has 2 divisors, whose sum is σ = 132104434544232. Its totient is φ = 132104434544230.
The previous prime is 132104434544177. The next prime is 132104434544233. The reversal of 132104434544231 is 132445434401231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132104434544231 - 214 = 132104434527847 is a prime.
It is a super-2 number, since 2×1321044345442312 (a number of 29 digits) contains 22 as substring.
Together with 132104434544233, 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 (132104434544233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66052217272115 + 66052217272116.
It is an arithmetic number, because the mean of its divisors is an integer number (66052217272116).
Almost surely, 2132104434544231 is an apocalyptic number.
132104434544231 is a deficient number, since it is larger than the sum of its proper divisors (1).
132104434544231 is an equidigital number, since it uses as much as digits as its factorization.
132104434544231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 552960, while the sum is 41.
Adding to 132104434544231 its reverse (132445434401231), we get a palindrome (264549868945462).
The spelling of 132104434544231 in words is "one hundred thirty-two trillion, one hundred four billion, four hundred thirty-four million, five hundred forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •