Base | Representation |
---|---|
bin | 101111111101111001… |
… | …100000001110110010 |
3 | 11220221102112002001100 |
4 | 233331321200032302 |
5 | 1320440103201010 |
6 | 35354420545230 |
7 | 3502216516122 |
oct | 577571401662 |
9 | 156842462040 |
10 | 51504350130 |
11 | 1a92a954622 |
12 | 9b94852216 |
13 | 4b1a62602c |
14 | 26c8446c82 |
15 | 151699d2c0 |
hex | bfde603b2 |
51504350130 has 144 divisors (see below), whose sum is σ = 141733463040. Its totient is φ = 12974516928.
The previous prime is 51504350113. The next prime is 51504350143. The reversal of 51504350130 is 3105340515.
51504350130 is a `hidden beast` number, since 5 + 150 + 4 + 3 + 501 + 3 + 0 = 666.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51504350094 and 51504350103.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 12441601 + ... + 12445739.
It is an arithmetic number, because the mean of its divisors is an integer number (984260160).
Almost surely, 251504350130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51504350130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70866731520).
51504350130 is an abundant number, since it is smaller than the sum of its proper divisors (90229112910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51504350130 is a wasteful number, since it uses less digits than its factorization.
51504350130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4573 (or 4551 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
Adding to 51504350130 its reverse (3105340515), we get a palindrome (54609690645).
The spelling of 51504350130 in words is "fifty-one billion, five hundred four million, three hundred fifty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •