14809
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 311
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14500
- Möbius Function
- 1
- Radical
- 14809
- 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
- 133
- Smith Number
- yes
- 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
- Number of single component edge-subgraphs in Moebius ladder M_n.at n=3A020868
- Partial sums of A000009 (partitions into distinct parts).at n=44A036469
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=15A049897
- Numbers n such that n*359# +-1 are twin primes, where 359# = 72nd primorial (A002110(72)).at n=16A087907
- sigma(n) + n is a square.at n=29A114069
- a(n) = least k >= 1 such that the remainder when 6^k is divided by k is n.at n=33A127816
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*(k+5)*p(k+6)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*(k+5)*p(k+6)+1 are twin primes with p(h) = h-th prime.at n=6A129313
- Members of A038512 of the form k, k+2, k+6, k+8.at n=15A155511
- Number of nondecreasing strings of numbers x(i=1..n) in -8..8 with sum x(i)^3 equal to 0.at n=11A188276
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and nonnegative determinant.at n=12A210290
- Total number of cycles in all partial permutations of {1,2,...,n}.at n=6A216313
- Number of partitions of n+5 with largest inscribed rectangle having area <= n.at n=30A218626
- Number of (n+3) X 5 0..1 matrices with each 4 X 4 subblock idempotent.at n=15A224562
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 123", based on the 5-celled von Neumann neighborhood.at n=6A270211
- Sum of quadratic residues of (n-th prime == 3 mod 4).at n=28A282035
- Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic residues mod p.at n=14A282723
- Number of ways to choose a constant rooted partition of each part in a strict rooted partition of n.at n=31A301767
- Number of nX3 0..1 arrays with every element unequal to 0, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=9A303883
- Number of inversion sequences of length n avoiding the consecutive patterns 012, 101, 102, and 201.at n=9A328429
- The excess of the number of partitions of n with more odd parts than even parts over the number of partitions of n with more even parts than odd parts.at n=40A338860