6995
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8400
- Proper Divisor Sum (Aliquot Sum)
- 1405
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5592
- Möbius Function
- 1
- Radical
- 6995
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 106
- 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
- Number of pebbling configurations with n pebbles.at n=12A007902
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=46A015990
- Expansion of (1-x)/((1-2x)(1+x-x^2)).at n=14A052964
- Numbers k such that the Lucas Aurifeuillian primitive part B of Lucas(k) is prime.at n=50A061443
- Smallest multiple of 5 with digit sum n.at n=28A069534
- Nested floor product of n and fractions (k+1)/k for all k>0 (mod 4), divided by 4.at n=19A073361
- Expansion of (1-4*x+2*x^2)/(1-7*x+13*x^2-4*x^3).at n=7A078789
- Inverse binomial transform of Fibonacci oblongs.at n=15A084178
- Number of (<=2)-covers of an n-set.at n=5A094574
- Positive integers i for which A112049(i) == 7.at n=13A112067
- Number of distinct angles in all integer-sided triangles with all sides <= n.at n=34A123325
- Let M be the matrix defined in A111490. Sequence gives M(2,1)-M(1,2), M(2,1)+M(3,1)+M(3,2)-M(1,2)-M(1,3)-M(2,3), etc.at n=39A123329
- a(n) = Sum_{k>=0} binomial(n,5*k+2).at n=15A139714
- a(n) = Sum_{ k >= 0} binomial(n,5*k+3).at n=15A139748
- Number of permutations of 1..n containing the relative rank sequence { 45231 } at any spacing.at n=3A158431
- Number of permutations of 1..n containing the relative rank sequence { 52341 } at any spacing.at n=3A158436
- Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n having k peak plateaux (0 <= k <= floor(n/3); U=(1,1), D=(1,-1)).at n=40A166285
- Number of Dyck paths with no UUU's and no DDD's, of semilength n having no peak plateaux (U=(1,1), D=(1,-1)).at n=14A166286
- a(n) = Sum_{k == floor(n/2) (mod 5)} C(n,k).at n=15A173125
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210603; see the Formula section.at n=47A210738