14854
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25488
- Proper Divisor Sum (Aliquot Sum)
- 10634
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6360
- Möbius Function
- -1
- Radical
- 14854
- 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
- 71
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 98.at n=25A020437
- a(n) = Sum_{k=0..n} T(n,k) * T(n,n+k), with T given by A027082.at n=7A027109
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5)).at n=53A036814
- Numbers k such that abs(9^k - 2^11) is prime.at n=12A122727
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) <= number of parts of p.at n=36A241829
- G.f.: Sum_{n=-oo..+oo} x^n * (1 + x^n)^n, an even function.at n=55A260361
- Number of nX2 integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than itself.at n=4A265874
- Number of nX5 integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than itself.at n=1A265877
- T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than itself.at n=16A265878
- T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than itself.at n=19A265878
- Minimal number of moves for the cyclic variant of Hanoi's tower for 4 pegs and n disks, with the final peg two steps away.at n=14A292764
- G.f. A(x) satisfies: A(x) = (1 - x^2*A(x)^2)/(1 - x^2*A(x)^2 - x^3*A(x)^3).at n=18A307529
- Number of non-self-conjugate partitions of n.at n=35A330644
- A290131/2.at n=20A331754