Base | Representation |
---|---|
bin | 1100101100101… |
… | …0100101000111 |
3 | 10201012211000112 |
4 | 3023022211013 |
5 | 102113233232 |
6 | 5141303235 |
7 | 1214455535 |
oct | 313124507 |
9 | 121184015 |
10 | 53258567 |
11 | 28076a4a |
12 | 15a04b1b |
13 | b05965b |
14 | 7105155 |
15 | 4a204b2 |
hex | 32ca947 |
53258567 has 8 divisors (see below), whose sum is σ = 54538176. Its totient is φ = 51985152.
The previous prime is 53258563. The next prime is 53258581. The reversal of 53258567 is 76585235.
53258567 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 a cyclic number.
It is not a de Polignac number, because 53258567 - 22 = 53258563 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53258563) 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, 19043 + ... + 21659.
It is an arithmetic number, because the mean of its divisors is an integer number (6817272).
Almost surely, 253258567 is an apocalyptic number.
53258567 is a deficient number, since it is larger than the sum of its proper divisors (1279609).
53258567 is a wasteful number, since it uses less digits than its factorization.
With its successor (53258568) it forms an eRAP, since the sums of their prime factors are consecutive (3097 and 3098).
53258567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3097.
The product of its digits is 252000, while the sum is 41.
The square root of 53258567 is about 7297.8467372232. The cubic root of 53258567 is about 376.2384347611.
The spelling of 53258567 in words is "fifty-three million, two hundred fifty-eight thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •