5325
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8928
- Proper Divisor Sum (Aliquot Sum)
- 3603
- 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
- 2800
- Möbius Function
- 0
- Radical
- 1065
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(17*n + 1)/2.at n=25A022275
- Convolution of A023531 and (F(2), F(3), F(4), ...).at n=18A023561
- Least m such that if r and s in {1/1, 1/4, 1/9,..., 1/n^2} satisfy r < s, then r < k/m < s for some integer k.at n=24A024827
- Sum of remainders when n-th prime is divided by all preceding integers.at n=39A050482
- Numbers k such that k^10 == 1 (mod 11^3).at n=40A056085
- Triangle a(n,m)=number of m-element antichains on a labeled n-set; number of monotone n-variable Boolean functions with m mincuts (lower units), m=0..binomial(n,floor(n,2)).at n=45A059119
- Positive numbers whose product of digits is 10 times their sum.at n=26A062043
- Numbers k such that k and its reversal are both multiples of 15.at n=28A062905
- Non-palindromic number and its reversal are both multiples of 15.at n=23A062914
- Right side of the triangle A075652.at n=42A075649
- a(n) = (2*n+5)*(2*n+1).at n=35A078371
- Greedy frac multiples of 1/Pi: a(1)=1, Sum_{n>0} frac(a(n)*x) = 1 at x=1/Pi, where "frac(y)" denotes the fractional part of y.at n=21A080142
- a(n) = (4*n+3)*(4*n+7).at n=17A085027
- Numbers n such that p = n^2 + 2, p+2 and p+6 are consecutive primes.at n=14A086380
- Numbers k such that p=k^2+2 and p+2 are primes.at n=48A086381
- Triangle T, read by rows, such that T(n,k) equals the (n-k)-th row sum of T^k, where T^k is the k-th power of T as a lower triangular matrix.at n=49A091351
- Triangle, read by rows, such that T(n,k) equals the k-th term of the convolution of the (n-1)-th diagonal with the k-th row of this triangle.at n=50A098446
- Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT_UP(T) = T^2 - T + I, or, equivalently: T(n+1,k+1) = [T^2](n,k) - T(n,k) + [T^0](n,k) for n>=k>=0, with T(0,0)=1.at n=59A104445
- Number of partitions of n which represent first player winning Chomp positions with unique winning moves.at n=32A112472
- Number of permutations of length n which avoid the patterns 1234, 1432, 4231.at n=10A116804