Base | Representation |
---|---|
bin | 11001010010000… |
… | …10111010110101 |
3 | 112210002002220211 |
4 | 30221002322311 |
5 | 413243231303 |
6 | 33013425421 |
7 | 5153463565 |
oct | 1451027265 |
9 | 483062824 |
10 | 212086453 |
11 | a9798767 |
12 | 5b03b271 |
13 | 34c29757 |
14 | 2024ada5 |
15 | 1394566d |
hex | ca42eb5 |
212086453 has 4 divisors (see below), whose sum is σ = 212121280. Its totient is φ = 212051628.
The previous prime is 212086403. The next prime is 212086489. The reversal of 212086453 is 354680212.
212086453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212086453 is a prime.
It is a super-2 number, since 2×2120864532 = 89961327092242418, 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 (212086403) 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, 5613 + ... + 21346.
It is an arithmetic number, because the mean of its divisors is an integer number (53030320).
Almost surely, 2212086453 is an apocalyptic number.
It is an amenable number.
212086453 is a deficient number, since it is larger than the sum of its proper divisors (34827).
212086453 is an equidigital number, since it uses as much as digits as its factorization.
212086453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34826.
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 212086453 is about 14563.1882841636. The cubic root of 212086453 is about 596.3542375997.
The spelling of 212086453 in words is "two hundred twelve million, eighty-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •