14631
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19512
- Proper Divisor Sum (Aliquot Sum)
- 4881
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9752
- Möbius Function
- 1
- Radical
- 14631
- 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
- 58
- 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
- Discriminants of quintic fields with 2 complex conjugates (negated).at n=21A023684
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048212.at n=26A048222
- Numbers n for which there are exactly four k such that n = k + reverse(k).at n=36A072428
- a(n) = 10*n^2 + 5*n + 1.at n=38A080860
- a(n) = (15*n^2 + 5*n + 2)/2.at n=43A093500
- Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of x with Ceiling[Log[x]] radius equals 6.at n=8A096517
- Semiprimes in A056106.at n=24A113524
- Number of permutations of length n which avoid the patterns 1234, 2143, 3421.at n=22A116842
- a(n) = 12*n^2 + 22*n + 11.at n=34A154106
- a(1)=1. a(n+1) = Sum_{k=1..n} a(b(k,n)), where b(k,n) is the largest positive integer that, when written in binary, occurs as a substring in both binary k and binary n.at n=41A175491
- Triangle, read by rows, T(n, k) = Sum_{j=0..k} (n+k)!/((n-j)!*(k-j)!*j!) + Sum_{j=0..n-k} (2*n-k)!/((n-j)!*(n-k-j)!*j!).at n=10A176081
- Triangle, read by rows, T(n, k) = Sum_{j=0..k} (n+k)!/((n-j)!*(k-j)!*j!) + Sum_{j=0..n-k} (2*n-k)!/((n-j)!*(n-k-j)!*j!).at n=14A176081
- Number of nonempty subsets of {1, 2, ..., n} with <=9 pairwise coprime elements.at n=26A187270
- Principal diagonal of the convolution array A213783.at n=42A213759
- Numbers k such that distances from k to three nearest squares are three triangular numbers.at n=19A232501
- Number of (n+1) X (5+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=5A235881
- Number of (n+1) X (6+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=4A235882
- Number of partitions of n such that (number of distinct parts) >= least part.at n=35A239952
- Numbers n such that 3*n and n^3 have the same digit sum.at n=31A260906
- a(n) = A266196(A000079(n)); indices of powers of 2 in A266195.at n=33A266186