Base | Representation |
---|---|
bin | 1100010100100… |
… | …1011000011111 |
3 | 10121020122201200 |
4 | 3011021120133 |
5 | 101212241144 |
6 | 5043410543 |
7 | 1165164612 |
oct | 305113037 |
9 | 117218650 |
10 | 51680799 |
11 | 27199605 |
12 | 15383a53 |
13 | a926471 |
14 | 6c14179 |
15 | 480cc69 |
hex | 314961f |
51680799 has 24 divisors (see below), whose sum is σ = 79606800. Its totient is φ = 32195328.
The previous prime is 51680771. The next prime is 51680843. The reversal of 51680799 is 99708615.
51680799 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 51680799 - 221 = 49583647 is a prime.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51680719) 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 23 ways as a sum of consecutive naturals, for example, 21664 + ... + 23930.
It is an arithmetic number, because the mean of its divisors is an integer number (3316950).
It is a vampire number, since it can be written as 6801 ⋅ 7599 (with its own digits).
Almost surely, 251680799 is an apocalyptic number.
51680799 is a deficient number, since it is larger than the sum of its proper divisors (27926001).
51680799 is a wasteful number, since it uses less digits than its factorization.
51680799 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2439 (or 2436 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 45.
The square root of 51680799 is about 7188.9358739663. The cubic root of 51680799 is about 372.4858160147.
The spelling of 51680799 in words is "fifty-one million, six hundred eighty thousand, seven hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •