Base | Representation |
---|---|
bin | 1100101000111… |
… | …0010010100111 |
3 | 10200202021021110 |
4 | 3022032102213 |
5 | 102032332443 |
6 | 5132120103 |
7 | 1212406560 |
oct | 312162247 |
9 | 120667243 |
10 | 53011623 |
11 | 27a18465 |
12 | 15906033 |
13 | aca1132 |
14 | 707d167 |
15 | 49c2233 |
hex | 328e4a7 |
53011623 has 32 divisors (see below), whose sum is σ = 84994560. Its totient is φ = 28748160.
The previous prime is 53011603. The next prime is 53011633. The reversal of 53011623 is 32611035.
53011623 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 53011623 - 25 = 53011591 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 53011623.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53011603) 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 31 ways as a sum of consecutive naturals, for example, 36436 + ... + 37862.
It is an arithmetic number, because the mean of its divisors is an integer number (2656080).
Almost surely, 253011623 is an apocalyptic number.
53011623 is a deficient number, since it is larger than the sum of its proper divisors (31982937).
53011623 is a wasteful number, since it uses less digits than its factorization.
53011623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1527.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 53011623 is about 7280.9081164371. The cubic root of 53011623 is about 375.6560321002.
Adding to 53011623 its reverse (32611035), we get a palindrome (85622658).
The spelling of 53011623 in words is "fifty-three million, eleven thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •