Base | Representation |
---|---|
bin | 110111010111… |
… | …000000010001 |
3 | 1000022021220212 |
4 | 313113000101 |
5 | 12203342040 |
6 | 1235013505 |
7 | 234231314 |
oct | 67270021 |
9 | 30267825 |
10 | 14512145 |
11 | 821220a |
12 | 4a3a295 |
13 | 301158b |
14 | 1cda97b |
15 | 1419d65 |
hex | dd7011 |
14512145 has 4 divisors (see below), whose sum is σ = 17414580. Its totient is φ = 11609712.
The previous prime is 14512139. The next prime is 14512159. The reversal of 14512145 is 54121541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54121541 = 3061 ⋅17681.
It can be written as a sum of positive squares in 2 ways, for example, as 11082241 + 3429904 = 3329^2 + 1852^2 .
It is a cyclic number.
It is not a de Polignac number, because 14512145 - 26 = 14512081 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14512145.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1451210 + ... + 1451219.
It is an arithmetic number, because the mean of its divisors is an integer number (4353645).
Almost surely, 214512145 is an apocalyptic number.
It is an amenable number.
14512145 is a deficient number, since it is larger than the sum of its proper divisors (2902435).
14512145 is an equidigital number, since it uses as much as digits as its factorization.
14512145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2902434.
The product of its digits is 800, while the sum is 23.
The square root of 14512145 is about 3809.4809357706. The cubic root of 14512145 is about 243.9180108387.
Adding to 14512145 its reverse (54121541), we get a palindrome (68633686).
The spelling of 14512145 in words is "fourteen million, five hundred twelve thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •