Base | Representation |
---|---|
bin | 11001100110000… |
… | …00001001000000 |
3 | 112221222201020200 |
4 | 30303000021000 |
5 | 414430242022 |
6 | 33145405200 |
7 | 5214614232 |
oct | 1463001100 |
9 | 487881220 |
10 | 214696512 |
11 | 100210738 |
12 | 5ba99800 |
13 | 35631774 |
14 | 2072a252 |
15 | 13cadbac |
hex | ccc0240 |
214696512 has 84 divisors (see below), whose sum is σ = 636658620. Its totient is φ = 69092352.
The previous prime is 214696511. The next prime is 214696529. The reversal of 214696512 is 215696412.
It can be written as a sum of positive squares in 2 ways, for example, as 81432576 + 133263936 = 9024^2 + 11544^2 .
It is a super-2 number, since 2×2146965122 = 92189184529932288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (214696511) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10278 + ... + 23130.
Almost surely, 2214696512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 214696512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (318329310).
214696512 is an abundant number, since it is smaller than the sum of its proper divisors (421962108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214696512 is a wasteful number, since it uses less digits than its factorization.
214696512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12900 (or 12887 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The square root of 214696512 is about 14652.5257890918. The cubic root of 214696512 is about 598.7906306809.
The spelling of 214696512 in words is "two hundred fourteen million, six hundred ninety-six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •