Base | Representation |
---|---|
bin | 11001100110100… |
… | …00011011000000 |
3 | 112222010002201121 |
4 | 30303100123000 |
5 | 414434410300 |
6 | 33151042024 |
7 | 5215312531 |
oct | 1463203300 |
9 | 488102647 |
10 | 214763200 |
11 | 100256853 |
12 | 5bb10314 |
13 | 35655c22 |
14 | 20746688 |
15 | 13cc381a |
hex | ccd06c0 |
214763200 has 42 divisors (see below), whose sum is σ = 528455636. Its totient is φ = 85904640.
The previous prime is 214763191. The next prime is 214763209. The reversal of 214763200 is 2367412.
It is an interprime number because it is at equal distance from previous prime (214763191) and next prime (214763209).
It is a super-2 number, since 2×2147632002 = 92246464148480000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (214763209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 65514 + ... + 68713.
Almost surely, 2214763200 is an apocalyptic number.
214763200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
214763200 is an abundant number, since it is smaller than the sum of its proper divisors (313692436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214763200 is a wasteful number, since it uses less digits than its factorization.
214763200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134249 (or 134234 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 25.
The square root of 214763200 is about 14654.8012610202. The cubic root of 214763200 is about 598.8526220866.
The spelling of 214763200 in words is "two hundred fourteen million, seven hundred sixty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •