14665
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 5495
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10032
- Möbius Function
- -1
- Radical
- 14665
- 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
- 71
- 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 1/((1+x)*(1-x)^5).at n=26A001752
- Truncated cube numbers.at n=8A005912
- a(n) = n*(n + 1)*(2*n^2 + 2*n - 1)/6.at n=13A006324
- Let S denote the palindromes in the language {0,1,2,3,4}*; a(n) = number of words of length n in the language SS.at n=8A007058
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A024975.at n=35A024980
- Numbers k such that 153*2^k+1 is prime.at n=21A032453
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, 0), (0, 1, -1), (1, 0, 1)}.at n=9A148920
- Partial sums of A165271.at n=33A165273
- The total number of elements(ordered pairs) in all equivalence relations on {1,2,...,n}.at n=7A175716
- p-INVERT of (1,1,1,1,1,...), where p(S) = 1 - 2 S - 2 S^3.at n=8A291337
- Partial sums of A299272.at n=22A299273