14925
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
- 12
- Divisor Sum
- 24800
- Proper Divisor Sum (Aliquot Sum)
- 9875
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7920
- Möbius Function
- 0
- Radical
- 2985
- Omega Function (Ω)
- 4
- 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
- 71
- 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
- Number of partitions in parts not of the form 13k, 13k+3 or 13k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=41A035951
- T(2n+1,n), array T as in A054126.at n=5A054132
- 4n^2+1, 2n^2+1, 2n^2-1 are all prime.at n=35A055755
- Main diagonal of triangle A131791: a(n) = A131791(n,n) for n>=0.at n=9A131792
- a(n) = nonnegative value y such that (A155135(n), y) is a solution to the Diophantine equation x^3+28*x^2 = y^2.at n=26A155137
- a(n) = nonnegative value y such that (A155136(n), y) is a solution to the Diophantine equation x^3+28*x^2 = y^2.at n=25A155138
- Number of n X 3 binary arrays without the pattern 0 0 diagonally or vertically.at n=6A188700
- T(n,k)=Number of nXk binary arrays without the pattern 0 0 diagonally or vertically.at n=42A188706
- Number of 7Xn binary arrays without the pattern 0 0 diagonally or vertically.at n=2A188711
- Number of nXnXn triangular 0..1 arrays with each element equal to the product mod 2 of two neighbors.at n=5A193323
- a(k) such that A225258 column k of T(n,k) = n*k^3 - a(k) for large n.at n=32A225263
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 2.at n=54A284688
- p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - 5 S + S^2.at n=5A291245
- Number of nXn 0..1 arrays with every element unequal to 0, 1 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=14A317766
- Number of compositions (ordered partitions) of n into distinct parts >= 3.at n=38A339101
- Partial sums of products of proper divisors of n (A007956).at n=26A339308
- Square array read by antidiagonals: T(n,k) is the number of n-tuples of nonnegative integers, not all equal to 0, with a shortest vectorial addition chain of length k; n >= 1, k >= 0.at n=57A383333
- Number of distinct squares (of any orientation) whose vertices are points of the cross of side n.at n=9A388848