Base | Representation |
---|---|
bin | 1100101111011… |
… | …1111101010100 |
3 | 10201120020222120 |
4 | 3023313331110 |
5 | 102140210221 |
6 | 5145255540 |
7 | 1216161453 |
oct | 313677524 |
9 | 121506876 |
10 | 53444436 |
11 | 28193661 |
12 | 15a945b0 |
13 | b0c3136 |
14 | 7152b9a |
15 | 4a5a5c6 |
hex | 32f7f54 |
53444436 has 12 divisors (see below), whose sum is σ = 124703712. Its totient is φ = 17814808.
The previous prime is 53444423. The next prime is 53444459. The reversal of 53444436 is 63444435.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 53444397 and 53444406.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2226840 + ... + 2226863.
It is an arithmetic number, because the mean of its divisors is an integer number (10391976).
Almost surely, 253444436 is an apocalyptic number.
It is an amenable number.
53444436 is an abundant number, since it is smaller than the sum of its proper divisors (71259276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53444436 is a wasteful number, since it uses less digits than its factorization.
53444436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4453710 (or 4453708 counting only the distinct ones).
The product of its digits is 69120, while the sum is 33.
The square root of 53444436 is about 7310.5701556035. The cubic root of 53444436 is about 376.6756092933.
Subtracting 53444436 from its reverse (63444435), we obtain a palindrome (9999999).
The spelling of 53444436 in words is "fifty-three million, four hundred forty-four thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •