14565
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
- 23328
- Proper Divisor Sum (Aliquot Sum)
- 8763
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7760
- Möbius Function
- -1
- Radical
- 14565
- 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
- yes
- 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
- 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
- Number of ordered 5-tuples of integers from [ 2,n ] with no global factor.at n=15A015651
- Powers of fifth root of 20 rounded to nearest integer.at n=16A018172
- Powers of fifth root of 20 rounded up.at n=16A018173
- Numbers k such that 79*2^k-1 is prime.at n=16A050565
- a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n*a(n-1).at n=36A095234
- Expansion of (1+3*x)/(1-2*x-7*x^2).at n=7A096980
- a(n) = 3 A113405(n)- A113405(n+1).at n=17A133511
- a(n) = 3*A131090(n) - A131090(n+1).at n=17A135261
- List of fixed points of the base-4 Kaprekar map A165012.at n=6A165016
- Consider the base-4 Kaprekar map n->K(n) defined in A165012. Sequence gives numbers belonging to cycles, including fixed points.at n=10A165017
- Consider the base-4 Kaprekar map n->K(n) defined in A165012. Sequence gives least elements of each cycle, including fixed points.at n=8A165021
- Smallest member of cycle corresponding to n-th term of A165029.at n=8A165030
- Number of nondecreasing arrangements of 6 numbers x(i) in -(n+4)..(n+4) with the sum of sign(x(i))*2^|x(i)| zero.at n=33A187990
- a(1) = 3; for n > 1, a(n) = 4*a(n-1) + 4 - n.at n=6A353095
- Array read by ascending antidiagonals: A(1, k) = k; for n > 1, A(n, k) = (k + 1)*A(n-1, k) + k + 1 - n, with k > 0.at n=38A363365
- Number of subsets of {1..n} whose cardinality can be written as a nonnegative linear combination of the elements.at n=14A367222
- Coefficient of x^n in the expansion of ( (1+x+x^2)^3 / (1+x) )^n.at n=6A372369
- a(n) = ceiling((2^n+n-1)/n).at n=17A373895
- Number of 4 element sets of distinct integer sided rectangles that fill an n X n square.at n=30A387171