Base | Representation |
---|---|
bin | 101111101100000111… |
… | …110101000010101100 |
3 | 11220011122100012001022 |
4 | 233230013311002230 |
5 | 1314332231144000 |
6 | 35305044433312 |
7 | 3461635541321 |
oct | 575407650254 |
9 | 156148305038 |
10 | 51206115500 |
11 | 1a797576521 |
12 | 9b109a8838 |
13 | 4aa08c5937 |
14 | 269a9b2b48 |
15 | 14ea6dc585 |
hex | bec1f50ac |
51206115500 has 48 divisors (see below), whose sum is σ = 111869940000. Its totient is φ = 20475892800.
The previous prime is 51206115473. The next prime is 51206115523. The reversal of 51206115500 is 551160215.
It is a self number, because there is not a number n which added to its sum of digits gives 51206115500.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1734866 + ... + 1764134.
It is an arithmetic number, because the mean of its divisors is an integer number (2330623750).
Almost surely, 251206115500 is an apocalyptic number.
51206115500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
51206115500 is an abundant number, since it is smaller than the sum of its proper divisors (60663824500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51206115500 is a wasteful number, since it uses less digits than its factorization.
51206115500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32787 (or 32775 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 51206115500 its reverse (551160215), we get a palindrome (51757275715).
The spelling of 51206115500 in words is "fifty-one billion, two hundred six million, one hundred fifteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.206 sec. • engine limits •