Base | Representation |
---|---|
bin | 10100010001011011010101 |
3 | 100222222210111 |
4 | 110101123111 |
5 | 2330024021 |
6 | 305523021 |
7 | 63112321 |
oct | 24213325 |
9 | 10888714 |
10 | 5314261 |
11 | 2aaa757 |
12 | 1943471 |
13 | 1140b44 |
14 | 9c4981 |
15 | 6ee8e1 |
hex | 5116d5 |
5314261 has 4 divisors (see below), whose sum is σ = 5320224. Its totient is φ = 5308300.
The previous prime is 5314249. The next prime is 5314271. The reversal of 5314261 is 1624135.
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.
It is a cyclic number.
It is not a de Polignac number, because 5314261 - 25 = 5314229 is a prime.
It is a super-2 number, since 2×53142612 = 56482739952242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5314201) 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, 1345 + ... + 3526.
It is an arithmetic number, because the mean of its divisors is an integer number (1330056).
Almost surely, 25314261 is an apocalyptic number.
It is an amenable number.
5314261 is a deficient number, since it is larger than the sum of its proper divisors (5963).
5314261 is a wasteful number, since it uses less digits than its factorization.
5314261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5962.
The product of its digits is 720, while the sum is 22.
The square root of 5314261 is about 2305.2680972069. The cubic root of 5314261 is about 174.5075789737.
Adding to 5314261 its reverse (1624135), we get a palindrome (6938396).
The spelling of 5314261 in words is "five million, three hundred fourteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •