14685
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 11235
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7040
- Möbius Function
- 1
- Radical
- 14685
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- no
- Odd
- yes
Appears in sequences
- Ceiling of Gamma(n+2/3)/Gamma(2/3).at n=8A020133
- a(n) = n*(27*n - 1)/2.at n=33A022284
- a(n) = Sum_{k=0..floor(n/2)} A026637(n-k, k).at n=20A026647
- Numbers k such that k and 2*k, taken together are pandigital.at n=4A115922
- Expansion of 3*x/(1 - 2*x^2 - 2*x + x^3).at n=10A120718
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=8A150072
- 11 times pentagonal numbers: 11*n*(3n-1)/2.at n=30A153449
- a(n) = Sum_{k<=n} A000203(k)*(n-k+1), where A000203(m) is the sum of divisors of m.at n=36A175254
- a(n) = n^4 + 4*n.at n=11A180354
- Partial sums of A217854.at n=9A224914
- Number of nX2 0..4 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it, modulo 5.at n=3A239250
- Number of nX4 0..4 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it, modulo 5.at n=1A239252
- T(n,k)=Number of nXk 0..4 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it, modulo 5.at n=11A239256
- T(n,k)=Number of nXk 0..4 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it, modulo 5.at n=13A239256
- Number of nonnegative integers with property that their base 5/2 expansion (see A024632) has n digits.at n=9A245415
- a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 0, a(1) = 1, a(2) = 0, a(3) = 2.at n=22A295681
- a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 0, a(1) = 2, a(2) = 0, a(3) = 1.at n=22A295682
- Number of compositions (ordered partitions) of n into prime parts such that no two adjacent parts are equal (Carlitz compositions).at n=36A301428
- G.f.: Sum_{n>=0} (n+1)*(n+2)*(n+3)/3! * x^n * (1 + x^n)^n.at n=24A326004
- a(n) = F(n)*F(n+1) mod L(n+2) where F=A000045 is the Fibonacci numbers and L = A000032 is the Lucas numbers.at n=19A348592