14921
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15312
- Proper Divisor Sum (Aliquot Sum)
- 391
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14532
- Möbius Function
- 1
- Radical
- 14921
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 133
- 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
- Differences between numbers k such that k and k+1 have the same sum of divisors.at n=38A054001
- Composite and every divisor (except 1) contains the digit 4.at n=4A062670
- Semiprimes whose factors are decimal palindromes when concatenated, omitting multiples of primes less than 11.at n=37A144719
- Number of partitions p of n such that if h = min(p), then h is an (h,2)-separator of p; see Comments.at n=53A239729
- Powers of 3 in base 60, concatenating the decimal values of the sexagesimal digits.at n=8A254334
- Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=30A254950
- Number of nX5 binary arrays with rows and columns lexicographically nondecreasing and row and column sums nondecreasing.at n=5A266359
- Number of nX6 binary arrays with rows and columns lexicographically nondecreasing and row and column sums nondecreasing.at n=4A266360
- T(n,k) = Number of n X k binary arrays with rows and columns lexicographically nondecreasing and row and column sums nondecreasing.at n=49A266362
- T(n,k) = Number of n X k binary arrays with rows and columns lexicographically nondecreasing and row and column sums nondecreasing.at n=50A266362
- Number of positive integer matrices with entries summing to n, with equal row-sums and equal column-sums.at n=30A323349
- MM-numbers of crossing set partitions.at n=15A324324
- Number of integer partitions of n with one fewer distinct multiplicities than distinct parts.at n=43A325244
- a(n) = Sum_{k=1..n} binomial(floor(n/k)+2,3).at n=40A364970
- Number of permutations (p(1),p(2),...,p(n)) of (1,2,...,n) such that p(i)-i is in {-2,0,5} for all i=1,...,n.at n=36A387020