5268
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
- 12320
- Proper Divisor Sum (Aliquot Sum)
- 7052
- 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
- 1752
- Möbius Function
- 0
- Radical
- 2634
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- Coordination sequence T6 for Zeolite Code MTT.at n=45A008194
- 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 48.at n=19A031546
- Dirichlet convolution of Fibonacci numbers with themselves.at n=17A034744
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) <= cn(3,5).at n=67A036870
- a(n)=(s(n)+2)/9, where s(n)=n-th base 9 palindrome that starts with 7.at n=38A043078
- Numbers k such that k*2^k + (k+1) is prime.at n=5A046845
- n^a(n) is the smallest power of n (with a(n) > 1) which starts with n.at n=32A051248
- 21-gonal numbers: a(n) = n*(19n - 17)/2.at n=24A051873
- Variant of A061417.at n=7A061860
- Numbers k such that prime(k+1)-(k+1)*tau(k+1) = prime(k-1)-(k-1)*tau(k-1) where tau(k) = A000005(k) is the number of divisors of k.at n=39A067335
- Pierce expansion of log(2).at n=11A091846
- Number of one-element transitions among partitions of the integer n for unlabeled parts.at n=19A093695
- Number of partitions of n into parts free of odd squares and the only number with multiplicity in the unrestricted partitions is the number 2.at n=52A100926
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns ending at an even level (1<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=36A121698
- Number of deco polyominoes of height n in which all columns end at an odd level. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=8A121753
- Sum of the entries of the first row of the matrix M^n, where M is the 4 X 4 matrix [[ -1, 3, -3, 1 ], [ 3, -6, 3, 0 ], [ -3, 0, 3, 0 ], [ 1, 4, 1, 0 ]].at n=6A123190
- Expansion of phi(x) / f(-x^4)^2 in powers of x where phi(), f() are Ramanujan theta functions.at n=53A137828
- a(n) = (5*n^2 - 11*n + 8)/2.at n=46A140066
- Expansion of g.f.: (1 + x^2 - x^3)/(1 - x - x^2 + x^3 - x^5).at n=24A147604
- Least number m such that floor((3^n-m)/(2^n-m)) > floor(3^n/2^n).at n=29A153725