Base | Representation |
---|---|
bin | 1100101001000… |
… | …1111101010010 |
3 | 10200210000212201 |
4 | 3022101331102 |
5 | 102033323032 |
6 | 5132313414 |
7 | 1212501424 |
oct | 312217522 |
9 | 120700781 |
10 | 53026642 |
11 | 27a28779 |
12 | 1591286a |
13 | aca7c16 |
14 | 7084814 |
15 | 49c68e7 |
hex | 3291f52 |
53026642 has 4 divisors (see below), whose sum is σ = 79539966. Its totient is φ = 26513320.
The previous prime is 53026639. The next prime is 53026643. The reversal of 53026642 is 24662035.
It is a happy number.
53026642 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 only one way, i.e., 52867441 + 159201 = 7271^2 + 399^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 53026642.
It is not an unprimeable number, because it can be changed into a prime (53026643) 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 as a sum of consecutive naturals, namely, 13256659 + ... + 13256662.
Almost surely, 253026642 is an apocalyptic number.
53026642 is a deficient number, since it is larger than the sum of its proper divisors (26513324).
53026642 is a wasteful number, since it uses less digits than its factorization.
53026642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26513323.
The product of its (nonzero) digits is 8640, while the sum is 28.
The square root of 53026642 is about 7281.9394394625. The cubic root of 53026642 is about 375.6915051084.
Adding to 53026642 its reverse (24662035), we get a palindrome (77688677).
It can be divided in two parts, 530 and 26642, that added together give a palindrome (27172).
The spelling of 53026642 in words is "fifty-three million, twenty-six thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •