Base | Representation |
---|---|
bin | 101111111111011111… |
… | …010110110101000000 |
3 | 11221000021202120210200 |
4 | 233333133112311000 |
5 | 1321013422102204 |
6 | 35401213125200 |
7 | 3502662462156 |
oct | 577737266500 |
9 | 157007676720 |
10 | 51531050304 |
11 | 1a943a30888 |
12 | 9ba1789800 |
13 | 4b23014056 |
14 | 26cbbd73d6 |
15 | 1518ec4539 |
hex | bff7d6d40 |
51531050304 has 336 divisors, whose sum is σ = 159193382400. Its totient is φ = 15899000832.
The previous prime is 51531050297. The next prime is 51531050309. The reversal of 51531050304 is 40305013515.
51531050304 is a `hidden beast` number, since 5 + 153 + 1 + 0 + 503 + 0 + 4 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51531050309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 55468912 + ... + 55469840.
Almost surely, 251531050304 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51531050304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79596691200).
51531050304 is an abundant number, since it is smaller than the sum of its proper divisors (107662332096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51531050304 is a wasteful number, since it uses less digits than its factorization.
51531050304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1102 (or 1089 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
Adding to 51531050304 its reverse (40305013515), we get a palindrome (91836063819).
The spelling of 51531050304 in words is "fifty-one billion, five hundred thirty-one million, fifty thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •