Base | Representation |
---|---|
bin | 110111011011… |
… | …011111100011 |
3 | 1000100020010211 |
4 | 313123133203 |
5 | 12204434111 |
6 | 1235234551 |
7 | 234336031 |
oct | 67333743 |
9 | 30306124 |
10 | 14530531 |
11 | 8225004 |
12 | 4a48a57 |
13 | 3019a62 |
14 | 1d03551 |
15 | 1420521 |
hex | ddb7e3 |
14530531 has 2 divisors, whose sum is σ = 14530532. Its totient is φ = 14530530.
The previous prime is 14530513. The next prime is 14530541. The reversal of 14530531 is 13503541.
It is a happy number.
Together with previous prime (14530513) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (13503541) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14530531 is a prime.
It is a super-2 number, since 2×145305312 = 422272662283922, which contains 22 as substring.
It is equal to p942304 and since 14530531 and 942304 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (14530511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7265265 + 7265266.
It is an arithmetic number, because the mean of its divisors is an integer number (7265266).
Almost surely, 214530531 is an apocalyptic number.
14530531 is a deficient number, since it is larger than the sum of its proper divisors (1).
14530531 is an equidigital number, since it uses as much as digits as its factorization.
14530531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 14530531 is about 3811.8933615724. The cubic root of 14530531 is about 244.0209771000.
The spelling of 14530531 in words is "fourteen million, five hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •