Base | Representation |
---|---|
bin | 110111110101… |
… | …111111011101 |
3 | 1000112202000202 |
4 | 313311333131 |
5 | 12221422234 |
6 | 1241433245 |
7 | 235300334 |
oct | 67657735 |
9 | 30482022 |
10 | 14639069 |
11 | 8299605 |
12 | 4a9b825 |
13 | 3057293 |
14 | 1d30d1b |
15 | 144277e |
hex | df5fdd |
14639069 has 4 divisors (see below), whose sum is σ = 14656896. Its totient is φ = 14621244.
The previous prime is 14639047. The next prime is 14639071. The reversal of 14639069 is 96093641.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 96093641 = 7 ⋅13727663.
It is a cyclic number.
It is not a de Polignac number, because 14639069 - 212 = 14634973 is a prime.
It is a super-2 number, since 2×146390692 = 428604682373522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14639029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7619 + ... + 9344.
It is an arithmetic number, because the mean of its divisors is an integer number (3664224).
Almost surely, 214639069 is an apocalyptic number.
It is an amenable number.
14639069 is a deficient number, since it is larger than the sum of its proper divisors (17827).
14639069 is an equidigital number, since it uses as much as digits as its factorization.
14639069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17826.
The product of its (nonzero) digits is 34992, while the sum is 38.
The square root of 14639069 is about 3826.1036316336. The cubic root of 14639069 is about 244.6270544045.
The spelling of 14639069 in words is "fourteen million, six hundred thirty-nine thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •