14746
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22644
- Proper Divisor Sum (Aliquot Sum)
- 7898
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7200
- Möbius Function
- -1
- Radical
- 14746
- 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
- 133
- 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
- Expansion of (1-x)/(1-x-2*x^3).at n=21A052537
- Numbers n such that sum of cubes of even digits of n equals sum of cubes of odd digits of n.at n=4A076165
- Number of partitions of n without rotational symmetry (or 1-fold symmetry).at n=34A085436
- Constant term in the reduction of the polynomial (x^2 + 2)^n by x^3 -> x^2 + 2. See Comments.at n=7A192808
- a(n) = the frequency of the most common 2-digit ending of a prime with n digits.at n=5A244255
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 57", based on the 5-celled von Neumann neighborhood.at n=27A270077
- Numbers k such that (8*10^k + 49)/3 is prime.at n=29A270890
- Partial sums of A299283.at n=20A299284
- G.f. A(x) satisfies: A(x) = Sum_{n>=0} x^n * A(x)^n * Product_{k=0..n-1} (4*k + 1).at n=5A302535
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=4A305589
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=3A305590
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=31A305593
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=32A305593