Base | Representation |
---|---|
bin | 1100011010001… |
… | …0011011100000 |
3 | 10121221012001110 |
4 | 3012202123200 |
5 | 101310424121 |
6 | 5055303320 |
7 | 1201244154 |
oct | 306423340 |
9 | 117835043 |
10 | 52045536 |
11 | 27418644 |
12 | 1551ab40 |
13 | aa2349a |
14 | 6cab064 |
15 | 4880d76 |
hex | 31a26e0 |
52045536 has 24 divisors (see below), whose sum is σ = 136619784. Its totient is φ = 17348480.
The previous prime is 52045519. The next prime is 52045537. The reversal of 52045536 is 63554025.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52045537) 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, 270975 + ... + 271166.
It is an arithmetic number, because the mean of its divisors is an integer number (5692491).
Almost surely, 252045536 is an apocalyptic number.
It is an amenable number.
52045536 is an abundant number, since it is smaller than the sum of its proper divisors (84574248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52045536 is a wasteful number, since it uses less digits than its factorization.
52045536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542154 (or 542146 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
The square root of 52045536 is about 7214.2592135298. The cubic root of 52045536 is about 373.3600349383.
It can be divided in two parts, 520 and 45536, that added together give a triangular number (46056 = T303).
The spelling of 52045536 in words is "fifty-two million, forty-five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •