Base | Representation |
---|---|
bin | 11001010110110… |
… | …01001100010001 |
3 | 112211020101020201 |
4 | 30223121030101 |
5 | 413422430334 |
6 | 33034535201 |
7 | 5161636234 |
oct | 1453311421 |
9 | 484211221 |
10 | 212701969 |
11 | aa079157 |
12 | 5b297501 |
13 | 350b396c |
14 | 2036b41b |
15 | 13a17c14 |
hex | cad9311 |
212701969 has 4 divisors (see below), whose sum is σ = 213877300. Its totient is φ = 211526640.
The previous prime is 212701961. The next prime is 212701987. The reversal of 212701969 is 969107212.
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 18378369 + 194323600 = 4287^2 + 13940^2 .
It is a cyclic number.
It is not a de Polignac number, because 212701969 - 23 = 212701961 is a prime.
It is a super-2 number, since 2×2127019692 = 90484255232953922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212701961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 587394 + ... + 587755.
It is an arithmetic number, because the mean of its divisors is an integer number (53469325).
Almost surely, 2212701969 is an apocalyptic number.
It is an amenable number.
212701969 is a deficient number, since it is larger than the sum of its proper divisors (1175331).
212701969 is a wasteful number, since it uses less digits than its factorization.
212701969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1175330.
The product of its (nonzero) digits is 13608, while the sum is 37.
The square root of 212701969 is about 14584.3055714011. The cubic root of 212701969 is about 596.9305922618.
The spelling of 212701969 in words is "two hundred twelve million, seven hundred one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •