14488
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27180
- Proper Divisor Sum (Aliquot Sum)
- 12692
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7240
- Möbius Function
- 0
- Radical
- 3622
- Omega Function (Ω)
- 4
- 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
- 71
- 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
- a(n)=T(n,n-4), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=4.at n=9A026573
- "CHJ" (necklace, identity, labeled) transform of 2,1,1,1...at n=5A032329
- Geometric mean of digits = 4 and digits are in nondecreasing order.at n=11A069518
- Number of partitions of n with rank 2 (the rank of a partition is the largest part minus the number of parts).at n=52A101199
- a(1)=a(2)=1. a(n+1) = a(n) + a(smallest prime dividing n).at n=41A128216
- L.g.f.: A(x) = log(G(x)) where G(x) = g.f. of A060690(n) = C(2^n+n-1,n).at n=3A140051
- a(n) = 13*n^2 + 10*n + 1.at n=33A161587
- Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m.at n=35A175356
- E.g.f. 1/(1-sin(x))^x.at n=8A191416
- Square array read by antidiagonals: T(m,n) = number of ways of drawing a simple loop on an m x n rectangular lattice of dots in such a way that it touches each edge.at n=30A232103
- Square array read by antidiagonals: T(m,n) = number of ways of drawing a simple loop on an m x n rectangular lattice of dots in such a way that it touches each edge.at n=33A232103
- Number of nX3 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=7A239845
- T(n,k) = Number of n X k 0..3 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 or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=47A239849
- T(n,k) = Number of n X k 0..3 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 or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=52A239849
- Number of partitions of prime(n) into n primes.at n=36A259254
- Number of fixed polyominoes without holes that have a width of n and height of 3.at n=5A293263
- a(n) = A122245(4+n) XOR 16*A122245(n).at n=0A376415