Base | Representation |
---|---|
bin | 1100101000110… |
… | …1000001011100 |
3 | 10200202000011001 |
4 | 3022031001130 |
5 | 102032201203 |
6 | 5132040044 |
7 | 1212355456 |
oct | 312150134 |
9 | 120660131 |
10 | 53006428 |
11 | 27a14572 |
12 | 15903024 |
13 | ac9b967 |
14 | 707b2d6 |
15 | 49c091d |
hex | 328d05c |
53006428 has 12 divisors (see below), whose sum is σ = 97643560. Its totient is φ = 25108272.
The previous prime is 53006423. The next prime is 53006441. The reversal of 53006428 is 82460035.
It is a junction number, because it is equal to n+sod(n) for n = 53006396 and 53006405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53006423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 348651 + ... + 348802.
Almost surely, 253006428 is an apocalyptic number.
It is an amenable number.
53006428 is a deficient number, since it is larger than the sum of its proper divisors (44637132).
53006428 is a wasteful number, since it uses less digits than its factorization.
53006428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697476 (or 697474 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 53006428 is about 7280.5513527479. The cubic root of 53006428 is about 375.6437605974.
The spelling of 53006428 in words is "fifty-three million, six thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •