Base | Representation |
---|---|
bin | 11001100010100… |
… | …00111111010000 |
3 | 112221010120201110 |
4 | 30301100333100 |
5 | 414321204412 |
6 | 33131533320 |
7 | 5211010002 |
oct | 1461207720 |
9 | 487116643 |
10 | 214241232 |
11 | aaa2a677 |
12 | 5b8ba240 |
13 | 3550247a |
14 | 2064c372 |
15 | 13c1dd3c |
hex | cc50fd0 |
214241232 has 40 divisors (see below), whose sum is σ = 553984384. Its totient is φ = 71345664.
The previous prime is 214241231. The next prime is 214241233. The reversal of 214241232 is 232142412.
It is an interprime number because it is at equal distance from previous prime (214241231) and next prime (214241233).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 214241199 and 214241208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214241231) 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 7 ways as a sum of consecutive naturals, for example, 88713 + ... + 91095.
Almost surely, 2214241232 is an apocalyptic number.
It is an amenable number.
214241232 is an abundant number, since it is smaller than the sum of its proper divisors (339743152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214241232 is a wasteful number, since it uses less digits than its factorization.
214241232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4267 (or 4261 counting only the distinct ones).
The product of its digits is 768, while the sum is 21.
The square root of 214241232 is about 14636.9816560656. The cubic root of 214241232 is about 598.3670710478.
Adding to 214241232 its reverse (232142412), we get a palindrome (446383644).
The spelling of 214241232 in words is "two hundred fourteen million, two hundred forty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •