15525
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 29760
- Proper Divisor Sum (Aliquot Sum)
- 14235
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7920
- Möbius Function
- 0
- Radical
- 345
- Omega Function (Ω)
- 6
- 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
- 146
- 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
- Number of partitions of n into parts of 6 kinds.at n=8A023005
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n.at n=44A057289
- a(n) = (2*n+1)*(2*n+3)*(2*n+5).at n=11A061550
- a(n+4) = floor( ( a(n) + 2*a(n+1) + 3*a(n+2) + 4*a(n+3) )/5 ), with a(0), a(1), a(2), a(3) equal to 0, 1, 2, 3.at n=26A074733
- Pascal-(1,3,1) array.at n=60A081578
- Third binomial transform of binomial(n+5, 5).at n=5A081902
- Coefficients of expansion of 1/sqrt(1 - 10*x + 9*x^2); also, a(n) is the central coefficient of (1 + 5*x + 4*x^2)^n.at n=5A084771
- Ninth diagonal of table A060850 counting partitions into parts of k kinds.at n=5A129126
- a(n) = (4*n+3)*(4*n+5)*(4*n+7).at n=5A133767
- Let y = y(u,v) be implicitly defined by g(u,v,y(u,v)) = 0. Read as a triangle by rows, the sequence represents the number of terms a(i,k-i) in the expansion of the bivariate divided difference [u_0,...,u_i; v_0,...,v_{k-i}]y in terms of trivariate divided differences of g.at n=21A172003
- Let y = y(u,v) be implicitly defined by g(u,v,y(u,v)) = 0. Read as a triangle by rows, the sequence represents the number of terms a(i,k-i) in the expansion of the bivariate divided difference [u_0,...,u_i; v_0,...,v_{k-i}]y in terms of trivariate divided differences of g.at n=25A172003
- Monotonic ordering of nonnegative differences 5^i-10^j, for 40>= i>=0, j>=0.at n=16A192201
- Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined at Comments.at n=13A193004
- 15 times triangular numbers.at n=45A194715
- Number of nX6 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=4A207366
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=49A207368
- Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=5A207370
- a(n) = A239793(n)/2^(3*n).at n=34A239795
- Integers, a, which are the solutions to the equation a^2 + b^3 = c^4, with integers a, b > 0, and indexed off of A242183.at n=26A242184
- a(n) = (4*n+9)*n^2.at n=15A258618