Base | Representation |
---|---|
bin | 101111100001110111… |
… | …110000011110010000 |
3 | 11212201122201102201211 |
4 | 233201313300132100 |
5 | 1314004214132240 |
6 | 35240022305504 |
7 | 3454446643645 |
oct | 574167603620 |
9 | 155648642654 |
10 | 51034130320 |
11 | 1a709488508 |
12 | 9a83288294 |
13 | 4a74099b64 |
14 | 2681c03dcc |
15 | 14da568bea |
hex | be1df0790 |
51034130320 has 160 divisors (see below), whose sum is σ = 125523965952. Its totient is φ = 19274497536.
The previous prime is 51034130297. The next prime is 51034130327. The reversal of 51034130320 is 2303143015.
It is a junction number, because it is equal to n+sod(n) for n = 51034130291 and 51034130300.
It is not an unprimeable number, because it can be changed into a prime (51034130327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13417539 + ... + 13421341.
Almost surely, 251034130320 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 51034130320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62761982976).
51034130320 is an abundant number, since it is smaller than the sum of its proper divisors (74489835632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51034130320 is a wasteful number, since it uses less digits than its factorization.
51034130320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3989 (or 3983 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 22.
Adding to 51034130320 its reverse (2303143015), we get a palindrome (53337273335).
The spelling of 51034130320 in words is "fifty-one billion, thirty-four million, one hundred thirty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •