7016
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13170
- Proper Divisor Sum (Aliquot Sum)
- 6154
- 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
- 3504
- Möbius Function
- 0
- Radical
- 1754
- Omega Function (Ω)
- 4
- 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
- 57
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 41.at n=30A031539
- Triangle of coefficients of ordered cycle-index polynomials: T(n,k) = binomial(n,k)*Bell(k)*Bell(n-k).at n=43A033306
- Triangle of coefficients of ordered cycle-index polynomials: T(n,k) = binomial(n,k)*Bell(k)*Bell(n-k).at n=37A033306
- Positive numbers having the same set of digits in base 8 and base 9.at n=29A037441
- Numbers having three 5's in base 9.at n=32A043475
- Number of rooted set partitions.at n=8A052889
- Triangle read by rows: T(n,c) = number of successive equalities in set partitions of n.at n=37A056857
- Triangle T(n,k) = number of element-subset partitions of {1..n} with n-k+1 equalities (n >= 1, 1 <= k <= n).at n=43A056860
- Interprimes which are of the form s*prime, s=8.at n=14A075283
- Column 6 of triangle A091602.at n=38A091609
- Even numbers n such that n^2 is an arithmetic number.at n=29A107924
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having height of last peak equal to k.at n=49A109158
- Natural number transform of Aitken's triangle.at n=28A127740
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k UUU's (triplerises) (n >= 0; 0 <= k <= n-2 for n >= 2).at n=31A128719
- Triangle read by rows, coefficients of the polynomials P(k, x) = (1/2) Sum_{p=0..k-1} Stirling2(k, p+1)*x^p*(1-4*x)^(k-1-p)*(2*p+2)!/(p+1)!.at n=18A142963
- Row sums of A136375.at n=10A151711
- Index of first occurrence of n in A154404.at n=33A154952
- Triangular array read by rows: T(n,k) is the number of blocks of size k in all set partitions of {1,2,...,n}.at n=28A175757
- Where zeros occur in the 1-0 race in the binary expansion of Pi-3; that is, n such that A174832(n) = 0.at n=42A178980
- Positive integers of the form (7*m^2+1)/11.at n=19A179370