14873
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 247
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14628
- Möbius Function
- 1
- Radical
- 14873
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- sech(cos(x)*arcsin(x))=1-1/2!*x^2+13/4!*x^4-325/6!*x^6+14873/8!*x^8...at n=4A012492
- Sum of the lengths of the cycle types of the permutation created by length sorting on the partitions of n.at n=34A036056
- Numbers whose base-5 representation contains exactly three 3's and three 4's.at n=12A045307
- Sum of squares of digits of n is equal to the largest prime factor of n.at n=38A074302
- Table T(n,k) by antidiagonals: T(n,k) = number of partitions of n balls of k colors.at n=63A075196
- Brilliant numbers k such that 2k+1 is also brilliant.at n=7A085649
- Least k such that n^k mod k = (n-1)^2, or 0 if no such k exists.at n=11A128150
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 2 X 2 elbow 1,1 1,2 2,1 in any orientation.at n=9A145939
- a(n) = 676*n + 1.at n=21A158386
- a(n) = 22*n^2 + 1.at n=26A158537
- Number of partitions of n objects of 3 colors.at n=9A217093
- Number of partitions of n+2 with largest inscribed rectangle having area <= n.at n=33A218623
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 553", based on the 5-celled von Neumann neighborhood.at n=24A272848
- Number of 2 X 2 matrices with all elements in {-n,..,0,..,n} with determinant = 2*permanent.at n=21A280343
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n), where a(0) = 2, a(1) = 3, b(0) = 1, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A295951
- Triangle read by rows: T(n,k) is the number of partitions of a 3-colored set of n objects into at most k parts with 0 <= k <= n.at n=54A382045