Base | Representation |
---|---|
bin | 110001011000100010… |
… | …010101000001001111 |
3 | 12001212101220011122100 |
4 | 301120202111001033 |
5 | 1332043400022201 |
6 | 40205341450143 |
7 | 3555003035154 |
oct | 613042250117 |
9 | 161771804570 |
10 | 53025001551 |
11 | 2054025a535 |
12 | a339b70953 |
13 | 5000699082 |
14 | 27d03a422b |
15 | 15a5226886 |
hex | c5889504f |
53025001551 has 12 divisors (see below), whose sum is σ = 79062368320. Its totient is φ = 34209678240.
The previous prime is 53025001543. The next prime is 53025001591. The reversal of 53025001551 is 15510052035.
53025001551 is a `hidden beast` number, since 5 + 3 + 0 + 2 + 500 + 155 + 1 = 666.
It is not a de Polignac number, because 53025001551 - 23 = 53025001543 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53025001591) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 95026606 + ... + 95027163.
Almost surely, 253025001551 is an apocalyptic number.
53025001551 is a deficient number, since it is larger than the sum of its proper divisors (26037366769).
53025001551 is a wasteful number, since it uses less digits than its factorization.
53025001551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190053806 (or 190053803 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
Adding to 53025001551 its reverse (15510052035), we get a palindrome (68535053586).
The spelling of 53025001551 in words is "fifty-three billion, twenty-five million, one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.816 sec. • engine limits •