Base | Representation |
---|---|
bin | 1100010010010… |
… | …1100110110101 |
3 | 10120222012201100 |
4 | 3010211212311 |
5 | 101143044021 |
6 | 5040320313 |
7 | 1164014442 |
oct | 304454665 |
9 | 116865640 |
10 | 51534261 |
11 | 270a94a9 |
12 | 15313099 |
13 | a8a485c |
14 | 6bb69c9 |
15 | 47ce626 |
hex | 31259b5 |
51534261 has 12 divisors (see below), whose sum is σ = 74513088. Its totient is φ = 34321704.
The previous prime is 51534233. The next prime is 51534269. The reversal of 51534261 is 16243515.
51534261 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 51534261 - 221 = 49437109 is a prime.
It is a super-2 number, since 2×515342612 = 5311560113632242, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51534269) 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 11 ways as a sum of consecutive naturals, for example, 9316 + ... + 13778.
It is an arithmetic number, because the mean of its divisors is an integer number (6209424).
Almost surely, 251534261 is an apocalyptic number.
It is an amenable number.
51534261 is a deficient number, since it is larger than the sum of its proper divisors (22978827).
51534261 is a wasteful number, since it uses less digits than its factorization.
51534261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5752 (or 5749 counting only the distinct ones).
The product of its digits is 3600, while the sum is 27.
The square root of 51534261 is about 7178.7367273079. The cubic root of 51534261 is about 372.1334285497.
Adding to 51534261 its reverse (16243515), we get a palindrome (67777776).
The spelling of 51534261 in words is "fifty-one million, five hundred thirty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •