Base | Representation |
---|---|
bin | 1100010001010… |
… | …1100101101101 |
3 | 10120211212201102 |
4 | 3010111211231 |
5 | 101133444103 |
6 | 5035052445 |
7 | 1163322245 |
oct | 304254555 |
9 | 116755642 |
10 | 51468653 |
11 | 27064185 |
12 | 152a1125 |
13 | a880a32 |
14 | 6b9ab25 |
15 | 47b9e88 |
hex | 311596d |
51468653 has 4 divisors (see below), whose sum is σ = 52724028. Its totient is φ = 50213280.
The previous prime is 51468647. The next prime is 51468679. The reversal of 51468653 is 35686415.
51468653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21141604 + 30327049 = 4598^2 + 5507^2 .
It is a cyclic number.
It is not a de Polignac number, because 51468653 - 26 = 51468589 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 (51468643) 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 3 ways as a sum of consecutive naturals, for example, 627626 + ... + 627707.
It is an arithmetic number, because the mean of its divisors is an integer number (13181007).
Almost surely, 251468653 is an apocalyptic number.
It is an amenable number.
51468653 is a deficient number, since it is larger than the sum of its proper divisors (1255375).
51468653 is a wasteful number, since it uses less digits than its factorization.
51468653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1255374.
The product of its digits is 86400, while the sum is 38.
The square root of 51468653 is about 7174.1656657761. The cubic root of 51468653 is about 371.9754411081.
The spelling of 51468653 in words is "fifty-one million, four hundred sixty-eight thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •