Base | Representation |
---|---|
bin | 1100010100111… |
… | …0001010110000 |
3 | 10121021122121122 |
4 | 3011032022300 |
5 | 101213403100 |
6 | 5044041412 |
7 | 1165306013 |
oct | 305161260 |
9 | 117248548 |
10 | 51700400 |
11 | 27202304 |
12 | 15393268 |
13 | a93236b |
14 | 6c1b37a |
15 | 4813985 |
hex | 314e2b0 |
51700400 has 60 divisors (see below), whose sum is σ = 131533992. Its totient is φ = 19461120.
The previous prime is 51700381. The next prime is 51700403. The reversal of 51700400 is 400715.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is not an unprimeable number, because it can be changed into a prime (51700403) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2999 + ... + 10601.
Almost surely, 251700400 is an apocalyptic number.
51700400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51700400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65766996).
51700400 is an abundant number, since it is smaller than the sum of its proper divisors (79833592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51700400 is a wasteful number, since it uses less digits than its factorization.
51700400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7638 (or 7627 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 17.
The square root of 51700400 is about 7190.2990202077. The cubic root of 51700400 is about 372.5329010172.
The spelling of 51700400 in words is "fifty-one million, seven hundred thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •