Base | Representation |
---|---|
bin | 1100011101001… |
… | …1010000100111 |
3 | 10122022100102010 |
4 | 3013103100213 |
5 | 101333324133 |
6 | 5103445303 |
7 | 1203036240 |
oct | 307232047 |
9 | 118270363 |
10 | 52245543 |
11 | 27544939 |
12 | 155b6833 |
13 | aa9352c |
14 | 6d1dcc7 |
15 | 48c0263 |
hex | 31d3427 |
52245543 has 8 divisors (see below), whose sum is σ = 79612288. Its totient is φ = 29854584.
The previous prime is 52245541. The next prime is 52245569. The reversal of 52245543 is 34554225.
52245543 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52245543 - 21 = 52245541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52245543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52245541) 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 7 ways as a sum of consecutive naturals, for example, 1243921 + ... + 1243962.
It is an arithmetic number, because the mean of its divisors is an integer number (9951536).
Almost surely, 252245543 is an apocalyptic number.
52245543 is a deficient number, since it is larger than the sum of its proper divisors (27366745).
52245543 is a wasteful number, since it uses less digits than its factorization.
52245543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2487893.
The product of its digits is 24000, while the sum is 30.
The square root of 52245543 is about 7228.1078436891. The cubic root of 52245543 is about 373.8376882502.
Adding to 52245543 its reverse (34554225), we get a palindrome (86799768).
The spelling of 52245543 in words is "fifty-two million, two hundred forty-five thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •