Base | Representation |
---|---|
bin | 1100100011011… |
… | …0010110100111 |
3 | 10200001222012000 |
4 | 3020312112213 |
5 | 101434321211 |
6 | 5120300343 |
7 | 1206346500 |
oct | 310662647 |
9 | 120058160 |
10 | 52651431 |
11 | 277a1888 |
12 | 157716b3 |
13 | aba61c1 |
14 | 6dc7ba7 |
15 | 4950656 |
hex | 32365a7 |
52651431 has 48 divisors (see below), whose sum is σ = 96115680. Its totient is φ = 28304640.
The previous prime is 52651411. The next prime is 52651441. The reversal of 52651431 is 13415625.
52651431 is a `hidden beast` number, since 5 + 2 + 651 + 4 + 3 + 1 = 666.
It is not a de Polignac number, because 52651431 - 27 = 52651303 is a prime.
It is a super-2 number, since 2×526514312 = 5544346372695522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 52651395 and 52651404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52651411) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21321 + ... + 23661.
It is an arithmetic number, because the mean of its divisors is an integer number (2002410).
Almost surely, 252651431 is an apocalyptic number.
52651431 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
52651431 is a deficient number, since it is larger than the sum of its proper divisors (43464249).
52651431 is a wasteful number, since it uses less digits than its factorization.
52651431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2381 (or 2368 counting only the distinct ones).
The product of its digits is 3600, while the sum is 27.
The square root of 52651431 is about 7256.1305804127. The cubic root of 52651431 is about 374.8032888306.
The spelling of 52651431 in words is "fifty-two million, six hundred fifty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •