Base | Representation |
---|---|
bin | 1100100001101… |
… | …1101100110010 |
3 | 10122212102102120 |
4 | 3020123230302 |
5 | 101422323013 |
6 | 5114055110 |
7 | 1205413266 |
oct | 310335462 |
9 | 118772376 |
10 | 52542258 |
11 | 2772785a |
12 | 1571a496 |
13 | ab685c2 |
14 | 6d9a0a6 |
15 | 492d123 |
hex | 321bb32 |
52542258 has 64 divisors (see below), whose sum is σ = 119577600. Its totient is φ = 15301440.
The previous prime is 52542253. The next prime is 52542263. The reversal of 52542258 is 85224525.
It is a happy number.
52542258 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 (52542253) and next prime (52542263).
It is not an unprimeable number, because it can be changed into a prime (52542253) 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 31 ways as a sum of consecutive naturals, for example, 75693 + ... + 76383.
It is an arithmetic number, because the mean of its divisors is an integer number (1868400).
Almost surely, 252542258 is an apocalyptic number.
52542258 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
52542258 is an abundant number, since it is smaller than the sum of its proper divisors (67035342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52542258 is a wasteful number, since it uses less digits than its factorization.
52542258 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 767.
The product of its digits is 32000, while the sum is 33.
The square root of 52542258 is about 7248.6038655730. The cubic root of 52542258 is about 374.5440574239.
The spelling of 52542258 in words is "fifty-two million, five hundred forty-two thousand, two hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •