14528
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 28956
- Proper Divisor Sum (Aliquot Sum)
- 14428
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7232
- Möbius Function
- 0
- Radical
- 454
- Omega Function (Ω)
- 7
- 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
- 19
- 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
- Series for first parallel moment of hexagonal lattice.at n=9A006740
- Expansion of e.g.f. cos(x)/cos(sin(x)), even powers only.at n=5A009104
- Expansion of e.g.f. log(1+sin(sin(x))).at n=11A009327
- Numbers k such that phi(k) + 7 | sigma(k).at n=6A015798
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 3).at n=50A035537
- Least number which may be expressed as the sum of a prime number and a nonzero square in exactly n different ways.at n=42A064283
- a(n) = 2*6^n-4^n.at n=5A081626
- Numbers k such that Fibonacci(k) concatenated with its 10's complement is prime.at n=24A084621
- a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n*a(n-1).at n=35A095234
- Number of partitions of n into Fibonacci number of integer parts.at n=44A102848
- Floor(exp(n)/n^2).at n=14A132405
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k columns with an odd sum (0<=k<=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.at n=50A181308
- Augmentation of the Euler triangle A008292. See Comments.at n=27A193590
- Number of n element 0..2 arrays with each element the minimum of 5 adjacent elements of a random 0..2 array of n+4 elements.at n=13A217880
- Number of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet (k=1,2,3,...) whose letters appear in alphabetical order and all k letters occur at least once in the composition.at n=7A261838
- Expansion of e.g.f. exp(2*(exp(2*x) - 1)).at n=5A308543
- Triangle read by rows. T(n, k) = k^n * BellPolynomial(n, k).at n=17A350257
- Number of integer partitions of n with all distinct run-sums.at n=37A353837
- a(n) is the least positive integer that can be expressed as the sum of a prime number and a square of a nonnegative integer in exactly n ways.at n=43A365288
- a(n) is the least positive integer that can be expressed as the sum of a prime number and a perfect power in exactly n ways.at n=44A365294