Base | Representation |
---|---|
bin | 111001000111… |
… | …100011110001 |
3 | 1001011201022211 |
4 | 321013203301 |
5 | 12313120134 |
6 | 1252532121 |
7 | 241161361 |
oct | 71074361 |
9 | 31151284 |
10 | 14973169 |
11 | 84a7622 |
12 | 5021041 |
13 | 3143383 |
14 | 1dba9a1 |
15 | 14ab764 |
hex | e478f1 |
14973169 has 4 divisors (see below), whose sum is σ = 15087600. Its totient is φ = 14858740.
The previous prime is 14973163. The next prime is 14973181. The reversal of 14973169 is 96137941.
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: 96137941 = 17 ⋅5655173.
It is a cyclic number.
It is not a de Polignac number, because 14973169 - 25 = 14973137 is a prime.
It is a super-2 number, since 2×149731692 = 448391579805122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14973163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is an upside-down number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57019 + ... + 57280.
It is an arithmetic number, because the mean of its divisors is an integer number (3771900).
Almost surely, 214973169 is an apocalyptic number.
It is an amenable number.
14973169 is a deficient number, since it is larger than the sum of its proper divisors (114431).
14973169 is a wasteful number, since it uses less digits than its factorization.
14973169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114430.
The product of its digits is 40824, while the sum is 40.
The square root of 14973169 is about 3869.5179286314. The cubic root of 14973169 is about 246.4740731453.
The spelling of 14973169 in words is "fourteen million, nine hundred seventy-three thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •