Base | Representation |
---|---|
bin | 1100001111110… |
… | …1000101000000 |
3 | 10120122210000000 |
4 | 3003331011000 |
5 | 101122241011 |
6 | 5033000000 |
7 | 1162423452 |
oct | 303750500 |
9 | 116583000 |
10 | 51368256 |
11 | 26aa5805 |
12 | 15253000 |
13 | a847124 |
14 | 6b722d2 |
15 | 479a356 |
hex | 30fd140 |
51368256 has 112 divisors (see below), whose sum is σ = 153294080. Its totient is φ = 17076096.
The previous prime is 51368243. The next prime is 51368279. The reversal of 51368256 is 65286315.
It is a Harshad number since it is a multiple of its sum of digits (36).
Its product of digits (43200) is a multiple of the sum of its prime factors (400).
It is a self number, because there is not a number n which added to its sum of digits gives 51368256.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 139785 + ... + 140151.
Almost surely, 251368256 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 51368256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76647040).
51368256 is an abundant number, since it is smaller than the sum of its proper divisors (101925824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51368256 is an frugal number, since it uses more digits than its factorization.
51368256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400 (or 372 counting only the distinct ones).
The product of its digits is 43200, while the sum is 36.
The square root of 51368256 is about 7167.1651299520. The cubic root of 51368256 is about 371.7334198328.
The spelling of 51368256 in words is "fifty-one million, three hundred sixty-eight thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •