Base | Representation |
---|---|
bin | 1100101110000… |
… | …0011000101111 |
3 | 10201101100112200 |
4 | 3023200120233 |
5 | 102124113022 |
6 | 5143232543 |
7 | 1215310125 |
oct | 313403057 |
9 | 121340480 |
10 | 53347887 |
11 | 2812806a |
12 | 15a48753 |
13 | b08b1c8 |
14 | 7129915 |
15 | 4a3bbac |
hex | 32e062f |
53347887 has 24 divisors (see below), whose sum is σ = 81881280. Its totient is φ = 33354240.
The previous prime is 53347873. The next prime is 53347901. The reversal of 53347887 is 78874335.
53347887 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (53347873) and next prime (53347901).
It is not a de Polignac number, because 53347887 - 24 = 53347871 is a prime.
Its product of digits (564480) is a multiple of the sum of its prime divisors (1260).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53347817) 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 23 ways as a sum of consecutive naturals, for example, 65539 + ... + 66347.
It is an arithmetic number, because the mean of its divisors is an integer number (3411720).
Almost surely, 253347887 is an apocalyptic number.
53347887 is a deficient number, since it is larger than the sum of its proper divisors (28533393).
53347887 is a wasteful number, since it uses less digits than its factorization.
53347887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1263 (or 1260 counting only the distinct ones).
The product of its digits is 564480, while the sum is 45.
The square root of 53347887 is about 7303.9637868763. The cubic root of 53347887 is about 376.4486472502.
The spelling of 53347887 in words is "fifty-three million, three hundred forty-seven thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •