7356
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17192
- Proper Divisor Sum (Aliquot Sum)
- 9836
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2448
- Möbius Function
- 0
- Radical
- 3678
- 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
- 163
- 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
- a(n) = a(n-1) + a(n-2) + n, a(0) = a(1) = 1.at n=16A030119
- 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 56.at n=33A031554
- Number of directed multigraphs with loops on 3 nodes with n arcs.at n=10A050927
- Partial sums of A000340, second partial sums of A003462.at n=7A052150
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=39A052477
- a(n) = Sum_{k=0..n} 3^k*F(k) where F(k) is the k-th Fibonacci number.at n=6A082987
- A Pascal-like triangle based on 3^n.at n=58A106516
- Triangle, read by rows, where the g.f. of column k, C_k(x), is defined by the recursion: C_k(x) = ( 1 + Sum_{n>=1} x^n*C_{n-1+k}(x) )^(k+1).at n=50A127082
- Numbers n such that primorial(n)/2 - 256 is prime.at n=15A139452
- 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, 0, 0), (-1, 0, 1), (0, -1, 1), (0, 1, -1), (1, 0, 0)}.at n=9A148570
- a(n) = 216*n + 12.at n=33A154519
- First differences of A029971.at n=43A164125
- The number of permutations p of {1,...,n} satisfying |p(i)-p(i+1)| is in {4,5} for i from 1 to n-1.at n=34A174708
- Number of (w,x,y,z) with all terms in {1,...,n} and |x-y| = w + |y-z|.at n=25A212683
- Number of (n+1)X(2+1) 0..2 arrays with the upper median plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A237561
- Number of (n+1)X(3+1) 0..2 arrays with the upper median plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A237562
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=7A237567
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=8A237567
- Number of partitions of n with difference 9 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=32A242700
- Numbers k such that 1 + k + k^3 + k^5 + k^7 + k^9 + ... + k^49 is prime.at n=36A244388