14645
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18360
- Proper Divisor Sum (Aliquot Sum)
- 3715
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11200
- Möbius Function
- -1
- Radical
- 14645
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 133
- 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
- Expansion of Product_{m>=1} (1 + m*q^m)^5.at n=8A022633
- a(n) = (d(n)-r(n))/2, where d = A026063 and r is the periodic sequence with fundamental period (1,1,0,1).at n=45A026064
- a(n) = n^4+4 = (n^2-2*n+2)*(n^2+2*n+2) = ((n-1)^2+1)*((n+1)^2+1).at n=11A057781
- Surround numbers of a length 2n zig-zag.at n=34A060641
- Indices of primes in sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 11 for n > 0.at n=10A101968
- Number of base 25 n-digit numbers with adjacent digits differing by four or less.at n=4A126520
- a(n) is the smallest number k larger than a(n-1) such that n*d(k)*sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).at n=16A134382
- Coefficients in the expansion of C^4/B^5, in Watson's notation of page 118.at n=9A160528
- Nonprime numbers with a sum of nonprime divisors which is a perfect square.at n=29A194580
- a(n) = smallest k having at least three prime divisors d such that (d + n) | (k + n).at n=42A202158
- Rectangular array: (row n) = b**c, where b(h) = h^3, c(h) = (n-1+h)^3, n>=1, h>=1, and ** = convolution.at n=22A213558
- a(n) = 11^n + n.at n=4A226737
- 38-gonal numbers: a(n) = n*(18*n-17).at n=29A282850
- Number of n X 3 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1's.at n=7A295546
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1s.at n=47A295551
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1s.at n=52A295551
- Repunit pseudoprimes: composite numbers k such that (10^k - 1)/9 == 1 (mod k).at n=41A303608
- Number of squarefree parts in the partitions of n into 7 parts.at n=40A309459
- Number of integer partitions of n whose multiplicities have multiplicities that cover an initial interval of positive integers.at n=39A325330
- a(n) is the least integer k such that sigma(k)/(d(k)*sopf(k)) = n where d=A000005, sigma=A000203 and sopf=A008472.at n=16A328174