14425
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17918
- Proper Divisor Sum (Aliquot Sum)
- 3493
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11520
- Möbius Function
- 0
- Radical
- 2885
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 120
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Pseudoprimes to base 24.at n=42A020152
- Strong pseudoprimes to base 57.at n=14A020283
- Triangle of Gaussian binomial coefficients [ n,k ] for q = 24.at n=11A022188
- Triangle of Gaussian binomial coefficients [ n,k ] for q = 24.at n=13A022188
- Composite numbers whose prime factors contain no digits other than 5 and 7.at n=24A036320
- a(n) = n^3 + n^2 + n + 1.at n=24A053698
- 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, 0), (-1, -1, 1), (0, 1, -1), (1, 0, 0), (1, 1, 0)}.at n=8A150085
- G.f. A satisfies -x+(1+x^3-x)*A+(x^4-x^2)*A^2+(x^5-x^3)*A^3-x^4*A^4 = 0.at n=16A177794
- G.f. satisfies: A(x) = x + sum_{n>=1} A(x)^prime(n).at n=8A218001
- a(n) = (24^n - 1)/23.at n=4A218727
- Total sum of parts of multiplicity 5 in all partitions of n.at n=36A222733
- Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 4.at n=13A244705
- Number of squares of all sizes in 3*n*(n+1)/2-ominoes in form of three-quarters of Aztec diamonds.at n=32A258440
- Number of (n+1)X(n+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0011 or 0111.at n=3A259242
- Number of (n+1)X(4+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0011 or 0111.at n=3A259246
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0011 or 0111.at n=24A259250
- 50-gonal numbers: a(n) = 48*n*(n-1)/2 + n.at n=25A261343
- Numbers missing from A001033 despite satisfying the necessary congruence conditions (see comments).at n=18A274470
- The least common multiple of 1+n and 1+n^2.at n=24A281660
- Number of nX6 0..1 arrays with every element unequal to 1, 2, 5 or 8 king-move adjacent elements, with upper left element zero.at n=9A304300