14811
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19752
- Proper Divisor Sum (Aliquot Sum)
- 4941
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9872
- Möbius Function
- 1
- Radical
- 14811
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 164
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Base-7 palindromes that start with 6.at n=24A043020
- Number of nonterminal symbols in a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.at n=14A092284
- Number of partitions of n such that all parts, with the possible exception of the smallest, appear only once.at n=47A115029
- a(n) = prime(n^2) - n^2.at n=43A141129
- a(n) = 529*n - 1.at n=27A158365
- a(n) = 28*n^2 - 1.at n=22A158554
- Hilltop maps: number of nX3 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 nX3 array.at n=4A218349
- Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 nX5 array.at n=2A218351
- T(n,k) = Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 n X k array.at n=23A218354
- T(n,k) = Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 n X k array.at n=25A218354
- Palindromic numbers in bases 4 and 7 written in base 10.at n=12A259378
- a(1) = 1; a(n+1) = Sum_{d|n} sigma(n/d)*a(d), where sigma = sum of divisors (A000203).at n=33A307817
- G.f. A(x) satisfies: A(x) = 1 + x + x^2 * A(x/(1 - x)) / (1 - x)^3.at n=10A351438
- Semiprimes p*q such that p*q+p+q, p*q-(p+q), p*q+2*(p+q) and p*q-2*(p+q) are all primes.at n=20A356765
- G.f. satisfies A(x) = 1 + x^3*A(x)^2 / (1 - x*A(x)).at n=18A365694
- a(n) is the number of 5 element sets of distinct integer-sided trapezoids whose base angles are 60 degrees that fill an equilateral triangular grid of side n units formed by directly binary space partitioning 3-trapezoid sets without forming 4-trapezoid sets.at n=35A391203