14944
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
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 29484
- Proper Divisor Sum (Aliquot Sum)
- 14540
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7456
- Möbius Function
- 0
- Radical
- 934
- Omega Function (Ω)
- 6
- 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
- 89
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 n-node trees not determined by their spectra.at n=16A006610
- 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 61.at n=25A031559
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,1,3}.at n=45A079957
- a(n) = 8n+5^n-3^n.at n=6A120969
- Row sums of triangle A131819.at n=34A131820
- Number of species of genus 1 Latin bi-trades of size n.at n=16A133163
- Numbers k such that the string k modulo 1000 is found at position k in the decimal digits of Pi.at n=39A153226
- Number of lines through at least 2 points of an 8 X n grid of points.at n=32A160848
- a(n) = sum of all divisors of all numbers k such that n^2 <= k < (n+1)^2.at n=15A168012
- E.g.f.: A(x) = Series_Reversion[ x - Sum_{n>=2} (-x)^n/(n(n-1)/2) ].at n=5A180715
- The sum of the lengths of the 2-compositions of n. A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n. The length of the 2-composition is the number of columns.at n=7A181290
- Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=4A235232
- Number of (n+1) X (5+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=0A235236
- T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=10A235239
- T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=14A235239
- Expansion of 1/E(q/E(q)) where E(q) = Product_{n>=1} (1 - q^n).at n=10A238440
- Expansion of phi(x)^2 / phi(-x^2) in powers of x where phi() is a Ramanujan theta function.at n=31A260314
- a(n) = 15*n^2 - 13*n.at n=32A263226
- Numbers k such that (7*10^k + 107)/3 is prime.at n=19A282667
- a(n) is the smallest integer k such that Omega(k) = n and Omega(2*k+1) = n+1 (where Omega is A001222).at n=5A330089