Base | Representation |
---|---|
bin | 1100010110110… |
… | …1010110000101 |
3 | 10121112010210022 |
4 | 3011231112011 |
5 | 101231444401 |
6 | 5050504525 |
7 | 1166350223 |
oct | 305552605 |
9 | 117463708 |
10 | 51828101 |
11 | 2728a246 |
12 | 15435145 |
13 | a978520 |
14 | 6c51b13 |
15 | 483b71b |
hex | 316d585 |
51828101 has 8 divisors (see below), whose sum is σ = 56730744. Its totient is φ = 47056320.
The previous prime is 51828097. The next prime is 51828109. The reversal of 51828101 is 10182815.
51828101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1560001 + 50268100 = 1249^2 + 7090^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51828101 - 22 = 51828097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51828109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31886 + ... + 33471.
It is an arithmetic number, because the mean of its divisors is an integer number (7091343).
Almost surely, 251828101 is an apocalyptic number.
It is an amenable number.
51828101 is a deficient number, since it is larger than the sum of its proper divisors (4902643).
51828101 is a wasteful number, since it uses less digits than its factorization.
51828101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65431.
The product of its (nonzero) digits is 640, while the sum is 26.
The square root of 51828101 is about 7199.1736331332. The cubic root of 51828101 is about 372.8393700132.
The spelling of 51828101 in words is "fifty-one million, eight hundred twenty-eight thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •