Base | Representation |
---|---|
bin | 110000000101100100… |
… | …101110100011011101 |
3 | 11221021101211100011101 |
4 | 300011210232203131 |
5 | 1321221034342001 |
6 | 35415300553101 |
7 | 3505342201633 |
oct | 600544564335 |
9 | 157241740141 |
10 | 51633121501 |
11 | 1a996607445 |
12 | a00b9b2791 |
13 | 4b3b201500 |
14 | 26db5a7353 |
15 | 1522e37a01 |
hex | c0592e8dd |
51633121501 has 6 divisors (see below), whose sum is σ = 55910421690. Its totient is φ = 47661342768.
The previous prime is 51633121499. The next prime is 51633121513. The reversal of 51633121501 is 10512133615.
It can be written as a sum of positive squares in 3 ways, for example, as 2169137476 + 49463984025 = 46574^2 + 222405^2 .
It is not a de Polignac number, because 51633121501 - 21 = 51633121499 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51633121501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51633121591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 152760546 + ... + 152760883.
It is an arithmetic number, because the mean of its divisors is an integer number (9318403615).
Almost surely, 251633121501 is an apocalyptic number.
It is an amenable number.
51633121501 is a deficient number, since it is larger than the sum of its proper divisors (4277300189).
51633121501 is a wasteful number, since it uses less digits than its factorization.
51633121501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305521455 (or 305521442 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 28.
The spelling of 51633121501 in words is "fifty-one billion, six hundred thirty-three million, one hundred twenty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •