Base | Representation |
---|---|
bin | 11001010100001… |
… | …10111101001101 |
3 | 112210121021012022 |
4 | 30222012331031 |
5 | 413331141013 |
6 | 33023415525 |
7 | 5156034221 |
oct | 1452067515 |
9 | 483537168 |
10 | 212365133 |
11 | a9969082 |
12 | 5b1545a5 |
13 | 34cc6556 |
14 | 202c0781 |
15 | 1399d008 |
hex | ca86f4d |
212365133 has 4 divisors (see below), whose sum is σ = 212395548. Its totient is φ = 212334720.
The previous prime is 212365099. The next prime is 212365169. The reversal of 212365133 is 331563212.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 134977924 + 77387209 = 11618^2 + 8797^2 .
It is a cyclic number.
It is not a de Polignac number, because 212365133 - 222 = 208170829 is a prime.
It is a super-3 number, since 3×2123651333 (a number of 26 digits) contains 333 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 (212365183) 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, 1085 + ... + 20637.
It is an arithmetic number, because the mean of its divisors is an integer number (53098887).
Almost surely, 2212365133 is an apocalyptic number.
It is an amenable number.
212365133 is a deficient number, since it is larger than the sum of its proper divisors (30415).
212365133 is a wasteful number, since it uses less digits than its factorization.
212365133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30414.
The product of its digits is 3240, while the sum is 26.
The square root of 212365133 is about 14572.7531029658. The cubic root of 212365133 is about 596.6153249346.
The spelling of 212365133 in words is "two hundred twelve million, three hundred sixty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •