14583
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
- 4
- Divisor Sum
- 19448
- Proper Divisor Sum (Aliquot Sum)
- 4865
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9720
- Möbius Function
- 1
- Radical
- 14583
- Omega Function (Ω)
- 2
- 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
- 164
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 80.at n=28A031578
- a(n) = floor(Pi^n mod n^Pi).at n=30A066434
- Row sums of triangle A098542, which shifts left and up under the matrix square.at n=7A098544
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n with height of second peak equal to k (n>=1; 0<=k<=n-1).at n=58A112307
- a(n) = a(n-1) + a(floor(n/2)) + a(ceiling(n/2)).at n=32A131205
- G.f.: A(x) = A_1 where A_1 = 1/[1 - x*(A_2)^3], A_2 = 1/[1 - x^2*(A_3)^3], A_3 = 1/[1 - x^3*(A_4)^3], ... A_n = 1/[1 - x^n*(A_{n+1})^3] for n>=1.at n=13A132334
- a(n) = 20*n^2 + 3.at n=26A167573
- Number of 4 X n 0..1 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=21A224040
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 593", based on the 5-celled von Neumann neighborhood.at n=17A283181
- Compound filter (prime signature & sum of the divisors): a(n) = P(A046523(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=47A286360
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=33A294872
- Odd numbers k such that the multiplicative orders of 2 modulo k and modulo k+2 are equal.at n=41A333743
- a(n) is the dot product of the vectors of the first n primes and the next n primes.at n=11A337574
- Position of first occurrence of n in A340300.at n=15A338459
- a(n) = number of k-tuples (u(1), u(2), ..., u(k)) with 1 <= u(1) < u(2) < ... < u(k) <= n such that u(i) - u(i-1) <= 5 for i = 2,...,k.at n=13A356621