Base | Representation |
---|---|
bin | 1100010000010… |
… | …1001101001110 |
3 | 10120201110200010 |
4 | 3010011031032 |
5 | 101124322200 |
6 | 5033414050 |
7 | 1162622514 |
oct | 304051516 |
9 | 116643603 |
10 | 51401550 |
11 | 27018822 |
12 | 1526a326 |
13 | a859325 |
14 | 6b804b4 |
15 | 47a5150 |
hex | 310534e |
51401550 has 96 divisors (see below), whose sum is σ = 136276992. Its totient is φ = 12791680.
The previous prime is 51401533. The next prime is 51401611. The reversal of 51401550 is 5510415.
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 47 ways as a sum of consecutive naturals, for example, 161992 + ... + 162308.
It is an arithmetic number, because the mean of its divisors is an integer number (1419552).
Almost surely, 251401550 is an apocalyptic number.
51401550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 51401550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68138496).
51401550 is an abundant number, since it is smaller than the sum of its proper divisors (84875442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51401550 is a wasteful number, since it uses less digits than its factorization.
51401550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402 (or 397 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 21.
The square root of 51401550 is about 7169.4874293774. The cubic root of 51401550 is about 371.8137146847.
Adding to 51401550 its reverse (5510415), we get a palindrome (56911965).
The spelling of 51401550 in words is "fifty-one million, four hundred one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •