Base | Representation |
---|---|
bin | 1110001000010… |
… | …1101111010001 |
3 | 11010112010110221 |
4 | 3202011233101 |
5 | 110133034144 |
6 | 5514153041 |
7 | 1316525101 |
oct | 342055721 |
9 | 133463427 |
10 | 59268049 |
11 | 30500a65 |
12 | 17a22781 |
13 | c381a69 |
14 | 7c2b201 |
15 | 530ad84 |
hex | 3885bd1 |
59268049 has 8 divisors (see below), whose sum is σ = 62972640. Its totient is φ = 55622016.
The previous prime is 59268017. The next prime is 59268089. The reversal of 59268049 is 94086295.
59268049 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 59268049 - 25 = 59268017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 59267996 and 59268014.
It is not an unprimeable number, because it can be changed into a prime (59268089) 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, 12544 + ... + 16609.
It is an arithmetic number, because the mean of its divisors is an integer number (7871580).
Almost surely, 259268049 is an apocalyptic number.
It is an amenable number.
59268049 is a deficient number, since it is larger than the sum of its proper divisors (3704591).
59268049 is a wasteful number, since it uses less digits than its factorization.
59268049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29279.
The product of its (nonzero) digits is 155520, while the sum is 43.
The square root of 59268049 is about 7698.5744784343. The cubic root of 59268049 is about 389.8883068271. Note that the first 3 decimals are identical.
The spelling of 59268049 in words is "fifty-nine million, two hundred sixty-eight thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •