Base | Representation |
---|---|
bin | 1100001100110… |
… | …0011000111111 |
3 | 10120021122102220 |
4 | 3003030120333 |
5 | 101044400311 |
6 | 5024420423 |
7 | 1160633160 |
oct | 303143077 |
9 | 116248386 |
10 | 51168831 |
11 | 2697999a |
12 | 15177713 |
13 | a7a741c |
14 | 6b1d767 |
15 | 475b206 |
hex | 30cc63f |
51168831 has 8 divisors (see below), whose sum is σ = 77971584. Its totient is φ = 29239320.
The previous prime is 51168811. The next prime is 51168841. The reversal of 51168831 is 13886115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51168831 - 27 = 51168703 is a prime.
It is a super-2 number, since 2×511688312 = 5236498531813122, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 51168792 and 51168801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51168811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1218285 + ... + 1218326.
It is an arithmetic number, because the mean of its divisors is an integer number (9746448).
Almost surely, 251168831 is an apocalyptic number.
51168831 is a deficient number, since it is larger than the sum of its proper divisors (26802753).
51168831 is a wasteful number, since it uses less digits than its factorization.
51168831 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2436621.
The product of its digits is 5760, while the sum is 33.
The square root of 51168831 is about 7153.2391963362. The cubic root of 51168831 is about 371.2517405172.
The spelling of 51168831 in words is "fifty-one million, one hundred sixty-eight thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •