Base | Representation |
---|---|
bin | 1100001111101… |
… | …1110100000000 |
3 | 10120122111220000 |
4 | 3003323310000 |
5 | 101122104242 |
6 | 5032520000 |
7 | 1162402365 |
oct | 303736400 |
9 | 116574800 |
10 | 51363072 |
11 | 26aa1922 |
12 | 15250000 |
13 | a844967 |
14 | 6b7046c |
15 | 4798a4c |
hex | 30fbd00 |
51363072 has 90 divisors (see below), whose sum is σ = 153217218. Its totient is φ = 17114112.
The previous prime is 51363047. The next prime is 51363073. The reversal of 51363072 is 27036315.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 43877376 + 7485696 = 6624^2 + 2736^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51363073) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 19498 + ... + 21974.
Almost surely, 251363072 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 51363072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76608609).
51363072 is an abundant number, since it is smaller than the sum of its proper divisors (101854146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51363072 is an equidigital number, since it uses as much as digits as its factorization.
51363072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2505 (or 2482 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The square root of 51363072 is about 7166.8034715625. The cubic root of 51363072 is about 371.7209145034.
Adding to 51363072 its reverse (27036315), we get a palindrome (78399387).
The spelling of 51363072 in words is "fifty-one million, three hundred sixty-three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •