Base | Representation |
---|---|
bin | 101111100011001011… |
… | …110100011100000000 |
3 | 11212210012011222220102 |
4 | 233203023310130000 |
5 | 1314030334313111 |
6 | 35242130501532 |
7 | 3455135153555 |
oct | 574313643400 |
9 | 155705158812 |
10 | 51056166656 |
11 | 1a71a969760 |
12 | 9a8a7348a8 |
13 | 4a78814101 |
14 | 2684adca2c |
15 | 14dc46d13b |
hex | be32f4700 |
51056166656 has 72 divisors (see below), whose sum is σ = 111257119344. Its totient is φ = 23190773760.
The previous prime is 51056166641. The next prime is 51056166661. The reversal of 51056166656 is 65666165015.
It is a self number, because there is not a number n which added to its sum of digits gives 51056166656.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 4491476 + ... + 4502828.
Almost surely, 251056166656 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 51056166656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55628559672).
51056166656 is an abundant number, since it is smaller than the sum of its proper divisors (60200952688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51056166656 is a wasteful number, since it uses less digits than its factorization.
51056166656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12977 (or 12963 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 47.
It can be divided in two parts, 51056 and 166656, that added together give a palindrome (217712).
The spelling of 51056166656 in words is "fifty-one billion, fifty-six million, one hundred sixty-six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •