Base | Representation |
---|---|
bin | 111100111111010011010001… |
… | …0111101001011010110010101 |
3 | 2121100110121112201121122002101 |
4 | 1321332212202331023112111 |
5 | 1030303423044224200031 |
6 | 5140544523323242101 |
7 | 220666235161250356 |
oct | 17176464275132625 |
9 | 2540417481548071 |
10 | 536465624053141 |
11 | 145a3088016a032 |
12 | 50202770079331 |
13 | 1a045650457923 |
14 | 9669109157d2d |
15 | 4204a7e3d2361 |
hex | 1e7e9a2f4b595 |
536465624053141 has 2 divisors, whose sum is σ = 536465624053142. Its totient is φ = 536465624053140.
The previous prime is 536465624053133. The next prime is 536465624053187. The reversal of 536465624053141 is 141350426564635.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 512961346822500 + 23504277230641 = 22648650^2 + 4848121^2 .
It is a cyclic number.
It is not a de Polignac number, because 536465624053141 - 23 = 536465624053133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (536465624053241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 268232812026570 + 268232812026571.
It is an arithmetic number, because the mean of its divisors is an integer number (268232812026571).
Almost surely, 2536465624053141 is an apocalyptic number.
It is an amenable number.
536465624053141 is a deficient number, since it is larger than the sum of its proper divisors (1).
536465624053141 is an equidigital number, since it uses as much as digits as its factorization.
536465624053141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104000, while the sum is 55.
The spelling of 536465624053141 in words is "five hundred thirty-six trillion, four hundred sixty-five billion, six hundred twenty-four million, fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •