14745
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23616
- Proper Divisor Sum (Aliquot Sum)
- 8871
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7856
- Möbius Function
- -1
- Radical
- 14745
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Denominators of continued fraction convergents to sqrt(452).at n=8A041861
- Expansion of e.g.f. exp(3*cosh(x))/e^3 (even powers only).at n=4A080527
- Values of n for which A095777(n) is 17 (those terms which are expressible in decimal digits for bases 2 through 18, but not for base 19).at n=4A095786
- Numbers that can be written from base 2 to base 18 using only the digits 0 to 9 (conjectured to be complete).at n=16A131646
- Maximum number of points visible from some point in a cubic n x n x n lattice.at n=25A141227
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 1, 0), (1, 0, 0), (1, 0, 1)}.at n=7A151092
- Number of n-digit numbers that are divisible by 5^n.at n=13A151754
- Triangle read by rows: T(n,0) = 3^n, T(n,k) = T(n,k-1) + T(n-1,k) for 0 < k < n, and T(n,n) = T(n,n-1).at n=38A165992
- G.f. (x + 1)^10/(x^10 + x^9 - x^7 - x^6 - x^5 - x^4 - x^3 + x + 1).at n=32A173243
- Numbers that are the product of 3 distinct primes a,b and c, such that a+b+c, a^2+b^2+c^2 and a^3+b^3+c^3 are prime numbers.at n=19A176911
- Fundamental discriminants of real quadratic number fields with class number 10.at n=37A218160
- Number of partitions of the set of odd numbers {1, 3, ..., 2*n-1} into two subsets such that the absolute difference of the sums of the two subsets is minimized.at n=20A290889
- Numbers k such that 3*10^k - 37 is prime.at n=19A295128
- Number of 3Xn 0..1 arrays with every element equal to 0, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=14A301907
- Maximal coefficient of (1 + x) * (1 + x^3) * (1 + x^5) * ... * (1 + x^(2*n-1)).at n=21A350504
- Number T(n,k) of sets of n words of length n over binary alphabet where the first letter occurs k times; triangle T(n,k), n>=0, n-signum(n)<=k<=n*(n-1)+signum(n), read by rows.at n=44A360693
- Numbers that begin a run of 3 consecutive odd valued terms in A360519.at n=3A361112
- Number of solutions to +- 1 +- 3 +- 5 +- 7 +- ... +- (2*n-1) = 0 or 1.at n=21A367087
- Number of solutions to +- 1 +- 3 +- 5 +- 7 +- ... +- (4*n-3) = 1.at n=11A369729