14840
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
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 38880
- Proper Divisor Sum (Aliquot Sum)
- 24040
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 0
- Radical
- 3710
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 120
- 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
- 4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n^2+n+4)/12.at n=20A006007
- a(n) = A011916(n) + A011922(n) - 1.at n=3A011918
- a(n) = (prime(n+2)^2 - 1)/3.at n=44A024700
- Partial sums of A051865.at n=20A050441
- Triangle of coefficients of polynomials enumerating trees with n labeled nodes by inversions.at n=51A052121
- a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3) with a(1) = 1 and a(k) = 0 if k <= 0.at n=8A061278
- Numbers n such that sigma(reverse(n)) = phi(n).at n=13A070856
- An interleaved sequence of pyramidal and polygonal numbers.at n=39A081283
- Numbers k such that 4^k + 2^k - 1 is prime.at n=24A098855
- Riordan array (1/(1-x-x^2), x(1+x)/(1-x-x^2)^2).at n=57A112973
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n having pyramid weight k.at n=60A114597
- Numbers k such that the k-th triangular number contains only digits {0,1,2}.at n=12A119034
- Numbers whose trajectory under the Esucarys map ends at the fixed point 247.at n=16A129133
- Zero followed by partial sums of A008865.at n=35A145067
- 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, 1), (0, 1, -1), (0, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150942
- Self-convolution of A005568, where A005568(n) is the product of two successive Catalan numbers C(n)*C(n+1).at n=5A168452
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k circular successions (0<=k<=n-1). A circular succession in a permutation p of [n] is either a pair p(i), p(i+1), where p(i+1)=p(i)+1 or the pair p(n), p(1) if p(1)=p(n)+1.at n=29A180188
- Number of permutations of [n] having exactly 1 circular succession. A circular succession in a permutation p of [n] is either a pair p(i), p(i+1), where p(i+1)=p(i)+1 or the pair p(n), p(1) if p(1)=p(n)+1.at n=7A180189
- a(0)=0, a(n) = (a(n-1) XOR n) * (n+1).at n=7A182437
- For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=31A185718