Base | Representation |
---|---|
bin | 1100001111001… |
… | …0000010111000 |
3 | 10120120111000020 |
4 | 3003302002320 |
5 | 101114314224 |
6 | 5032010440 |
7 | 1162144632 |
oct | 303620270 |
9 | 116514006 |
10 | 51323064 |
11 | 26a74861 |
12 | 15230a20 |
13 | a82c6a0 |
14 | 6b5da52 |
15 | 478bc79 |
hex | 30f20b8 |
51323064 has 64 divisors (see below), whose sum is σ = 138915840. Its totient is φ = 15707520.
The previous prime is 51323029. The next prime is 51323071. The reversal of 51323064 is 46032315.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
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, 84249 + ... + 84855.
It is an arithmetic number, because the mean of its divisors is an integer number (2170560).
Almost surely, 251323064 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 51323064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69457920).
51323064 is an abundant number, since it is smaller than the sum of its proper divisors (87592776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51323064 is a wasteful number, since it uses less digits than its factorization.
51323064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 900 (or 896 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 51323064 is about 7164.0117252835. The cubic root of 51323064 is about 371.6243751495.
Adding to 51323064 its reverse (46032315), we get a palindrome (97355379).
The spelling of 51323064 in words is "fifty-one million, three hundred twenty-three thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •