Base | Representation |
---|---|
bin | 101111100101110111… |
… | …000010010011001000 |
3 | 11212220022122022100120 |
4 | 233211313002103020 |
5 | 1314123332100211 |
6 | 35250412503240 |
7 | 3456221521140 |
oct | 574567022310 |
9 | 155808568316 |
10 | 51101050056 |
11 | 1a743235281 |
12 | 9aa177ab20 |
13 | 4a84bca634 |
14 | 268aa63920 |
15 | 14e1386d06 |
hex | be5dc24c8 |
51101050056 has 64 divisors (see below), whose sum is σ = 146047708800. Its totient is φ = 14595829248.
The previous prime is 51101050051. The next prime is 51101050079. The reversal of 51101050056 is 65005010115.
51101050056 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×511010500562 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (51101050051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 524476 + ... + 614228.
It is an arithmetic number, because the mean of its divisors is an integer number (2281995450).
Almost surely, 251101050056 is an apocalyptic number.
51101050056 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
51101050056 is an abundant number, since it is smaller than the sum of its proper divisors (94946658744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51101050056 is a wasteful number, since it uses less digits than its factorization.
51101050056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93158 (or 93154 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 51101050056 in words is "fifty-one billion, one hundred one million, fifty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •