14881
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 671
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14212
- Möbius Function
- 1
- Radical
- 14881
- 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
- 45
- 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
- Left diagonal of partition triangle A047812.at n=33A007042
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 78 ones.at n=10A031846
- Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 5).at n=49A035556
- Numerators of continued fraction convergents to sqrt(634).at n=7A042216
- To get next term, multiply by 17, add 1 and discard any prime factors < 17.at n=17A057216
- To get next term, multiply by 17, add 1 and discard any prime factors < 17.at n=39A057216
- Engel expansion of Gamma(3/4) = Sum_{i>0} 1/Product_{n=1..i} 1/a(n).at n=5A068478
- Numbers k such that the k-th prime is of the form 2*j^2 + 1.at n=39A090612
- Numbers n such that (j^k + k^j) == 0 (mod k+j), j=4 case.at n=16A114979
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 6 and 8.at n=29A136994
- a(n) = 1 + n*(n+1)*(n-1)/2.at n=31A158842
- Centered 32-gonal numbers.at n=30A195315
- Number of n X 2 0..7 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=4A201102
- T(n,k)=Number of nXk 0..7 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=16A201105
- T(n,k)=Number of nXk 0..7 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=19A201105
- Number of ordered triples (i,j,k) with |i|, |j|, |k|, |i*j*k| <= n.at n=32A226359
- Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 with each element having directed index change 0,1 0,-2 1,0 or -1,0.at n=4A264296
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-2 1,0 or -1,0.at n=32A264299
- Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having directed index change 0,1 0,-2 1,0 or -1,0.at n=3A264304
- Numbers whose square has a prime number of partitions.at n=5A284594