14622
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29256
- Proper Divisor Sum (Aliquot Sum)
- 14634
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4872
- Möbius Function
- -1
- Radical
- 14622
- 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
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Number of permutations of [n] with n-3 sequences.at n=4A001759
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=37A025001
- 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=30A031578
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k alternating runs (n>=2, k>=1).at n=25A059427
- Numbers which are the sum of their proper divisors containing the digit 7.at n=17A059466
- a(0) = 1, a(1) = 1 and for n >= 2, a(n) = floor(4 * a(n-2) * a(n-1) / (a(n-2) + a(n-1))).at n=23A093335
- Triangle T, read by rows, equal to the matrix 4th power of triangle A113095, which satisfies the recurrence: A113095(n,k) = [A113095^4](n-1,k-1) + [A113095^4](n-1,k).at n=12A113101
- Number of partitions of n having no doubletons. By a doubleton in a partition we mean an occurrence of a part exactly twice (the partition [4,(3,3),2,2,2,(1,1)] of 18 has two doubletons, shown between parentheses).at n=40A116645
- 6 times centered hexagonal numbers: 18*n*(n+1) + 6.at n=28A164016
- Positions of 3's in A234323.at n=26A234804
- Given a circle of radius R into which small circles of radius R/2^n are packed in a "hexagonal pattern" (see Comments), a(n) is the maximum number of small circles.at n=7A239073
- Number of partitions of n with difference 7 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=37A242698
- Total number of points on a sphere when both poles are on an x by x grid where x=8*n+1.at n=42A254527
- Expansion of Product_{k>=1} (1 + x^k)/(1 - 2*x^k).at n=11A264685
- Triangle read by rows: T(n,k) is the number of non-isomorphic colorings of a toroidal n X k grid using exactly two colors under translational symmetry, 1 <= k <= n.at n=17A294684
- a(n) = number of partitions of n whose difference multiset has at least one duplicate; see Comments.at n=35A364612