Base | Representation |
---|---|
bin | 10011010010110000000001 |
3 | 100111221122012 |
4 | 103102300001 |
5 | 2243320122 |
6 | 300222305 |
7 | 60663002 |
oct | 23226001 |
9 | 10457565 |
10 | 5057537 |
11 | 2944891 |
12 | 183a995 |
13 | 1081034 |
14 | 9591a9 |
15 | 69d7e2 |
hex | 4d2c01 |
5057537 has 4 divisors (see below), whose sum is σ = 5062320. Its totient is φ = 5052756.
The previous prime is 5057527. The next prime is 5057561. The reversal of 5057537 is 7357505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 7357505 = 5 ⋅1471501.
It is a cyclic number.
It is not a de Polignac number, because 5057537 - 212 = 5053441 is a prime.
It is an Ulam number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5057527) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23 + ... + 3180.
It is an arithmetic number, because the mean of its divisors is an integer number (1265580).
Almost surely, 25057537 is an apocalyptic number.
It is an amenable number.
5057537 is a deficient number, since it is larger than the sum of its proper divisors (4783).
5057537 is a wasteful number, since it uses less digits than its factorization.
5057537 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4782.
The product of its (nonzero) digits is 18375, while the sum is 32.
The square root of 5057537 is about 2248.8968406754. The cubic root of 5057537 is about 171.6510072539.
Subtracting from 5057537 its sum of digits (32), we obtain a palindrome (5057505).
Subtracting 5057537 from its reverse (7357505), we obtain a cube (2299968 = 1323).
The spelling of 5057537 in words is "five million, fifty-seven thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •