Base | Representation |
---|---|
bin | 110001011000010100… |
… | …101101101010110101 |
3 | 12001212011011211211022 |
4 | 301120110231222311 |
5 | 1332041441320001 |
6 | 40205133150525 |
7 | 3554630511602 |
oct | 613024555265 |
9 | 161764154738 |
10 | 53021432501 |
11 | 20539242004 |
12 | a33892b445 |
13 | 4ccca196cb |
14 | 27cdb156a9 |
15 | 15a4c6e11b |
hex | c5852dab5 |
53021432501 has 2 divisors, whose sum is σ = 53021432502. Its totient is φ = 53021432500.
The previous prime is 53021432491. The next prime is 53021432507. The reversal of 53021432501 is 10523412035.
It is a happy number.
53021432501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51677110276 + 1344322225 = 227326^2 + 36665^2 .
It is a cyclic number.
It is not a de Polignac number, because 53021432501 - 214 = 53021416117 is a prime.
It is a super-2 number, since 2×530214325012 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53021432507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26510716250 + 26510716251.
It is an arithmetic number, because the mean of its divisors is an integer number (26510716251).
Almost surely, 253021432501 is an apocalyptic number.
It is an amenable number.
53021432501 is a deficient number, since it is larger than the sum of its proper divisors (1).
53021432501 is an equidigital number, since it uses as much as digits as its factorization.
53021432501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 53021432501 its reverse (10523412035), we get a palindrome (63544844536).
The spelling of 53021432501 in words is "fifty-three billion, twenty-one million, four hundred thirty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •