5348
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10752
- Proper Divisor Sum (Aliquot Sum)
- 5404
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2280
- Möbius Function
- 0
- Radical
- 2674
- 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
- 46
- 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
- Expansion of e.g.f.: sin(log(1+x))/cosh(x).at n=8A009460
- Coordination sequence T2 for Zeolite Code VNI.at n=45A009908
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 5).at n=56A035582
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047040; Sum{T(i,n-i): i=0,1,...,n}, array T given by A047050.at n=14A047041
- Numbers k such that k | sigma_5(k).at n=33A055709
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 81 ).at n=28A063354
- Number of partitions of n with at most 2 odd parts.at n=40A100835
- Numbers n whose abundance is 56.at n=43A101260
- Number of partitions of n with at most 3 odd parts.at n=40A114312
- Start with 1 and repeatedly reverse the digits and add 47 to get the next term.at n=32A118145
- Twice nonagonal numbers (or twice 9-gonal numbers): a(n) = n*(7*n-5).at n=28A139268
- Number of permutations of floor(i*7/6), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=7A147904
- Number of permutations of floor(i*7/6), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147913
- 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, 0), (-1, 0, 1), (0, 0, 1), (1, 0, 0), (1, 1, -1)}.at n=7A150193
- Number of binary strings of length n with no substrings equal to 0001 or 1100.at n=15A164400
- Partial sums of the union of squares and triangular numbers.at n=41A193711
- Number of n X n 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=4A207387
- Number of n X 5 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=4A207388
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=40A207391
- Number of 5Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=4A207394