Base | Representation |
---|---|
bin | 11001010011010… |
… | …10101110111101 |
3 | 112210101101121211 |
4 | 30221222232331 |
5 | 413313441113 |
6 | 33021124421 |
7 | 5155043206 |
oct | 1451525675 |
9 | 483341554 |
10 | 212249533 |
11 | a989a241 |
12 | 5b0b9711 |
13 | 34c85a52 |
14 | 202905ad |
15 | 13978b3d |
hex | ca6abbd |
212249533 has 4 divisors (see below), whose sum is σ = 212289660. Its totient is φ = 212209408.
The previous prime is 212249507. The next prime is 212249563. The reversal of 212249533 is 335942212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 164942649 + 47306884 = 12843^2 + 6878^2 .
It is a cyclic number.
It is not a de Polignac number, because 212249533 - 29 = 212249021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212249495 and 212249504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212249503) 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, 10660 + ... + 23197.
It is an arithmetic number, because the mean of its divisors is an integer number (53072415).
Almost surely, 2212249533 is an apocalyptic number.
It is an amenable number.
212249533 is a deficient number, since it is larger than the sum of its proper divisors (40127).
212249533 is an equidigital number, since it uses as much as digits as its factorization.
212249533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40126.
The product of its digits is 12960, while the sum is 31.
The square root of 212249533 is about 14568.7862569261. The cubic root of 212249533 is about 596.5070503344.
The spelling of 212249533 in words is "two hundred twelve million, two hundred forty-nine thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •