14828
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 28392
- Proper Divisor Sum (Aliquot Sum)
- 13564
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 0
- Radical
- 7414
- Omega Function (Ω)
- 4
- 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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Sum of terms in n-th row of A077164.at n=24A077167
- Integers that are Rhonda numbers to base 12.at n=12A100971
- Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutations A127377/A127378 and A127387.at n=14A127389
- a(n) is the number of Dyck paths of length n without height of peaks 1 (mod 3) and height of valleys 2 (mod 3).at n=13A152173
- Row sums of triangle defined in A113820.at n=24A160968
- a(n) = Sum_{k<=n} A007955(k) * A007955(n-k+1), where A007955(m) = product of divisors of m.at n=13A174938
- Expansion of 1/(1-x^6-3*x^5-4*x^4-3*x^3-2*x^2-x).at n=11A186812
- Number of (n+1) X (1+1) 0..3 arrays with 2 X 2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions but not both.at n=4A234762
- Number of (n+1)X(5+1) 0..3 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions but not both.at n=0A234766
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions but not both.at n=10A234769
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions but not both.at n=14A234769
- Numbers k such that 22*10^k + 7 is prime.at n=28A271646
- Numbers n such that Bernoulli number B_{n} has denominator 690.at n=22A272186
- Number of partitions of n into parts with an odd number of distinct prime divisors.at n=56A285799
- a(n) is the number of squares strictly between Fibonacci(n) and Fibonacci(n+1).at n=47A350701