Base | Representation |
---|---|
bin | 1110000101000… |
… | …0111111111111 |
3 | 11010010011011021 |
4 | 3201100333333 |
5 | 110104131111 |
6 | 5505405011 |
7 | 1314635233 |
oct | 341207777 |
9 | 133104137 |
10 | 59052031 |
11 | 30373735 |
12 | 17939767 |
13 | c30763c |
14 | 7bb25c3 |
15 | 52b6d71 |
hex | 3850fff |
59052031 has 4 divisors (see below), whose sum is σ = 59184000. Its totient is φ = 58920064.
The previous prime is 59051987. The next prime is 59052047. The reversal of 59052031 is 13025095.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13025095 = 5 ⋅2605019.
It is a cyclic number.
It is not a de Polignac number, because 59052031 - 27 = 59051903 is a prime.
It is a super-2 number, since 2×590520312 = 6974284730449922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 59051987 and 59052005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (59052131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65311 + ... + 66208.
It is an arithmetic number, because the mean of its divisors is an integer number (14796000).
Almost surely, 259052031 is an apocalyptic number.
59052031 is a deficient number, since it is larger than the sum of its proper divisors (131969).
59052031 is a wasteful number, since it uses less digits than its factorization.
59052031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131968.
The product of its (nonzero) digits is 1350, while the sum is 25.
The square root of 59052031 is about 7684.5319310938. The cubic root of 59052031 is about 389.4140466619.
The spelling of 59052031 in words is "fifty-nine million, fifty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •