Base | Representation |
---|---|
bin | 110111001011… |
… | …011010000101 |
3 | 1000012212202121 |
4 | 313023122011 |
5 | 12200332040 |
6 | 1234005541 |
7 | 233642656 |
oct | 67133205 |
9 | 30185677 |
10 | 14464645 |
11 | 818a558 |
12 | 4a168b1 |
13 | 2cc5a80 |
14 | 1cc752d |
15 | 140ac4a |
hex | dcb685 |
14464645 has 8 divisors (see below), whose sum is σ = 18692856. Its totient is φ = 10681536.
The previous prime is 14464633. The next prime is 14464657. The reversal of 14464645 is 54646441.
It is an interprime number because it is at equal distance from previous prime (14464633) and next prime (14464657).
It can be written as a sum of positive squares in 4 ways, for example, as 1083681 + 13380964 = 1041^2 + 3658^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14464645 - 27 = 14464517 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14464645.
It is a congruent number.
It is an unprimeable number.
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, 111202 + ... + 111331.
It is an arithmetic number, because the mean of its divisors is an integer number (2336607).
Almost surely, 214464645 is an apocalyptic number.
It is an amenable number.
14464645 is a deficient number, since it is larger than the sum of its proper divisors (4228211).
14464645 is a wasteful number, since it uses less digits than its factorization.
14464645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222551.
The product of its digits is 46080, while the sum is 34.
The square root of 14464645 is about 3803.2413807172. The cubic root of 14464645 is about 243.6515956061.
The spelling of 14464645 in words is "fourteen million, four hundred sixty-four thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •