Base | Representation |
---|---|
bin | 1101100001001… |
… | …1010100000101 |
3 | 10221200202210222 |
4 | 3120103110011 |
5 | 104003432323 |
6 | 5343154125 |
7 | 1255650401 |
oct | 330232405 |
9 | 127622728 |
10 | 56702213 |
11 | 2a009237 |
12 | 16ba5945 |
13 | b993c09 |
14 | 7760101 |
15 | 4ea09c8 |
hex | 3613505 |
56702213 has 4 divisors (see below), whose sum is σ = 59686560. Its totient is φ = 53717868.
The previous prime is 56702203. The next prime is 56702227. The reversal of 56702213 is 31220765.
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 an emirpimes, since its reverse is a distinct semiprime: 31220765 = 5 ⋅6244153.
It is a cyclic number.
It is not a de Polignac number, because 56702213 - 210 = 56701189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56702203) 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, 1492145 + ... + 1492182.
It is an arithmetic number, because the mean of its divisors is an integer number (14921640).
Almost surely, 256702213 is an apocalyptic number.
It is an amenable number.
56702213 is a deficient number, since it is larger than the sum of its proper divisors (2984347).
56702213 is a wasteful number, since it uses less digits than its factorization.
56702213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2984346.
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 56702213 is about 7530.0871840902. The cubic root of 56702213 is about 384.1787475294.
Adding to 56702213 its reverse (31220765), we get a palindrome (87922978).
The spelling of 56702213 in words is "fifty-six million, seven hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •