Base | Representation |
---|---|
bin | 110111011100… |
… | …000101010101 |
3 | 1000100100110101 |
4 | 313130011111 |
5 | 12210023244 |
6 | 1235254101 |
7 | 234346054 |
oct | 67340525 |
9 | 30310411 |
10 | 14532949 |
11 | 8226902 |
12 | 4a4a331 |
13 | 301aba2 |
14 | 1d0439b |
15 | 14210d4 |
hex | ddc155 |
14532949 has 2 divisors, whose sum is σ = 14532950. Its totient is φ = 14532948.
The previous prime is 14532937. The next prime is 14532961. The reversal of 14532949 is 94923541.
It is a balanced prime because it is at equal distance from previous prime (14532937) and next prime (14532961).
It can be written as a sum of positive squares in only one way, i.e., 8892324 + 5640625 = 2982^2 + 2375^2 .
It is an emirp because it is prime and its reverse (94923541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14532949 - 29 = 14532437 is a prime.
It is a super-2 number, since 2×145329492 = 422413213273202, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14532989) 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 as a sum of consecutive naturals, namely, 7266474 + 7266475.
It is an arithmetic number, because the mean of its divisors is an integer number (7266475).
Almost surely, 214532949 is an apocalyptic number.
It is an amenable number.
14532949 is a deficient number, since it is larger than the sum of its proper divisors (1).
14532949 is an equidigital number, since it uses as much as digits as its factorization.
14532949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 38880, while the sum is 37.
The square root of 14532949 is about 3812.2105135997. The cubic root of 14532949 is about 244.0345120492.
The spelling of 14532949 in words is "fourteen million, five hundred thirty-two thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.447 sec. • engine limits •