Base | Representation |
---|---|
bin | 1100001101101… |
… | …0111010000000 |
3 | 10120101200000000 |
4 | 3003122322000 |
5 | 101103301123 |
6 | 5030000000 |
7 | 1161301416 |
oct | 303327200 |
9 | 116350000 |
10 | 51228288 |
11 | 26a0a631 |
12 | 151a6000 |
13 | a7c84c7 |
14 | 6b372b6 |
15 | 476db43 |
hex | 30dae80 |
51228288 has 144 divisors (see below), whose sum is σ = 155586210. Its totient is φ = 16796160.
The previous prime is 51228271. The next prime is 51228299. The reversal of 51228288 is 88282215.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 50808384 + 419904 = 7128^2 + 648^2 .
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
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 17 ways as a sum of consecutive naturals, for example, 839778 + ... + 839838.
Almost surely, 251228288 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 51228288, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77793105).
51228288 is an abundant number, since it is smaller than the sum of its proper divisors (104357922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51228288 is an frugal number, since it uses more digits than its factorization.
51228288 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99 (or 66 counting only the distinct ones).
The product of its digits is 20480, while the sum is 36.
The square root of 51228288 is about 7157.3939391373. The cubic root of 51228288 is about 371.3954801739.
The spelling of 51228288 in words is "fifty-one million, two hundred twenty-eight thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •