Base | Representation |
---|---|
bin | 101111100000100111… |
… | …010001001010101100 |
3 | 11212200012000110022200 |
4 | 233200213101022230 |
5 | 1313433313434242 |
6 | 35233550141500 |
7 | 3454102414440 |
oct | 574047211254 |
9 | 155605013280 |
10 | 51013030572 |
11 | 1a6a85869a9 |
12 | 9a781b1890 |
13 | 4a6c8bccba |
14 | 267d0b0820 |
15 | 14d879c04c |
hex | be09d12ac |
51013030572 has 216 divisors, whose sum is σ = 153791898624. Its totient is φ = 13963238784.
The previous prime is 51013030571. The next prime is 51013030613. The reversal of 51013030572 is 27503031015.
51013030572 is a `hidden beast` number, since 51 + 0 + 13 + 0 + 30 + 572 = 666.
It is not an unprimeable number, because it can be changed into a prime (51013030571) 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 71 ways as a sum of consecutive naturals, for example, 23113093 + ... + 23115299.
Almost surely, 251013030572 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 51013030572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76895949312).
51013030572 is an abundant number, since it is smaller than the sum of its proper divisors (102778868052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51013030572 is a wasteful number, since it uses less digits than its factorization.
51013030572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2365 (or 2323 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
Adding to 51013030572 its reverse (27503031015), we get a palindrome (78516061587).
The spelling of 51013030572 in words is "fifty-one billion, thirteen million, thirty thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •