Base | Representation |
---|---|
bin | 10100010101011000011101 |
3 | 101000211000111 |
4 | 110111120131 |
5 | 2331033321 |
6 | 310130021 |
7 | 63210463 |
oct | 24253035 |
9 | 11024014 |
10 | 5330461 |
11 | 3010944 |
12 | 1950911 |
13 | 1148326 |
14 | 9ca833 |
15 | 7045e1 |
hex | 51561d |
5330461 has 4 divisors (see below), whose sum is σ = 5514300. Its totient is φ = 5146624.
The previous prime is 5330459. The next prime is 5330471. The reversal of 5330461 is 1640335.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1640335 = 5 ⋅328067.
It can be written as a sum of positive squares in 2 ways, for example, as 4368100 + 962361 = 2090^2 + 981^2 .
It is a cyclic number.
It is not a de Polignac number, because 5330461 - 21 = 5330459 is a prime.
It is a Duffinian number.
5330461 is a lucky number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5330471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91876 + ... + 91933.
It is an arithmetic number, because the mean of its divisors is an integer number (1378575).
Almost surely, 25330461 is an apocalyptic number.
It is an amenable number.
5330461 is a deficient number, since it is larger than the sum of its proper divisors (183839).
5330461 is a wasteful number, since it uses less digits than its factorization.
5330461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183838.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 5330461 is about 2308.7791145972. The cubic root of 5330461 is about 174.6847221363.
Adding to 5330461 its reverse (1640335), we get a palindrome (6970796).
The spelling of 5330461 in words is "five million, three hundred thirty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •