14691
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 5469
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9512
- Möbius Function
- -1
- Radical
- 14691
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 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
- Numbers k such that the smoothly undulating palindromic number (37*10^k - 73)/99 is a prime.at n=9A062219
- The smallest magic constant for n X n magic square with prime entries (regarding 1 as a prime).at n=14A073502
- a(1) = 1 then the least multiple of odd numbers not odd multiples of 5, (3,7,9,11,13,17,19,21,23,27,29,...) such that every partial concatenation is noncomposite.at n=33A110433
- a(n) = ceiling( Sum_{i=1..n-1} a(i)/5 ), a(1)=1.at n=56A120170
- Smallest k such that 33^k mod k = n.at n=30A178194
- a(n) = (A216363(n) - 1)/118.at n=30A216380
- Least positive integer k such that both k and k*n belong to the set {m>0: prime(prime(m))-prime(m)+1 = prime(p) for some prime p}.at n=29A260753
- Number of n X 3 0..1 arrays with each 1 horizontally or vertically adjacent to 0 or 2 1s.at n=6A295046
- Number of nX7 0..1 arrays with each 1 horizontally or vertically adjacent to 0 or 2 1s.at n=2A295050
- T(n,k) = Number of n X k 0..1 arrays with each 1 horizontally or vertically adjacent to 0 or 2 1's.at n=38A295051
- T(n,k) = Number of n X k 0..1 arrays with each 1 horizontally or vertically adjacent to 0 or 2 1's.at n=42A295051
- Number of n X 5 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1's.at n=6A296324
- Number of nX7 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1s.at n=4A296326
- T(n,k) = Number of n X k 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1's.at n=59A296327
- T(n,k) = Number of n X k 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1's.at n=61A296327
- Indices i in A112058 where records of 17*i - 3*A112058(i)/8 occur.at n=23A298991
- G.f. A(x) satisfies: [x^n] (1+x)^(n^2) / A(x) = 0 for n > 0.at n=5A304191
- Positive integers that have exactly nine representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=25A317399
- Sum of the areas of all r X s rectangles such that r + s = 2n, with r, s composite.at n=33A334229
- Numbers that are the sum of six fourth powers in four or more ways.at n=11A345561