Base | Representation |
---|---|
bin | 111000000101… |
… | …111001010100 |
3 | 1000200001101110 |
4 | 320011321110 |
5 | 12231013322 |
6 | 1243055020 |
7 | 235661265 |
oct | 70057124 |
9 | 30601343 |
10 | 14704212 |
11 | 8333546 |
12 | 4b11470 |
13 | 307ab23 |
14 | 1d4a96c |
15 | 1456c0c |
hex | e05e54 |
14704212 has 24 divisors (see below), whose sum is σ = 34372800. Its totient is φ = 4892416.
The previous prime is 14704211. The next prime is 14704213. The reversal of 14704212 is 21240741.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (14704211) and next prime (14704213).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14704211) 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 7 ways as a sum of consecutive naturals, for example, 10489 + ... + 11807.
It is an arithmetic number, because the mean of its divisors is an integer number (1432200).
Almost surely, 214704212 is an apocalyptic number.
14704212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14704212 is an abundant number, since it is smaller than the sum of its proper divisors (19668588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14704212 is a wasteful number, since it uses less digits than its factorization.
14704212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2255 (or 2253 counting only the distinct ones).
The product of its (nonzero) digits is 448, while the sum is 21.
The square root of 14704212 is about 3834.6071506740. The cubic root of 14704212 is about 244.9893761880.
Adding to 14704212 its reverse (21240741), we get a palindrome (35944953).
The spelling of 14704212 in words is "fourteen million, seven hundred four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •