Base | Representation |
---|---|
bin | 11110000001001101001101… |
… | …110011011100110000111111 |
3 | 122022110101210211002022212211 |
4 | 132001031031303130300333 |
5 | 114301041234042411133 |
6 | 1144443043424241251 |
7 | 36544304232526642 |
oct | 3601151563346077 |
9 | 568411724068784 |
10 | 132024305044543 |
11 | 3908121437078a |
12 | 12983240770227 |
13 | 5888ab938b802 |
14 | 24860209b1a59 |
15 | 103e3c6220bcd |
hex | 78134dcdcc3f |
132024305044543 has 2 divisors, whose sum is σ = 132024305044544. Its totient is φ = 132024305044542.
The previous prime is 132024305044529. The next prime is 132024305044553. The reversal of 132024305044543 is 345440503420231.
It is a strong prime.
It is an emirp because it is prime and its reverse (345440503420231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132024305044543 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132024305044496 and 132024305044505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132024305044553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66012152522271 + 66012152522272.
It is an arithmetic number, because the mean of its divisors is an integer number (66012152522272).
Almost surely, 2132024305044543 is an apocalyptic number.
132024305044543 is a deficient number, since it is larger than the sum of its proper divisors (1).
132024305044543 is an equidigital number, since it uses as much as digits as its factorization.
132024305044543 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 691200, while the sum is 40.
Adding to 132024305044543 its reverse (345440503420231), we get a palindrome (477464808464774).
The spelling of 132024305044543 in words is "one hundred thirty-two trillion, twenty-four billion, three hundred five million, forty-four thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •