16275
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 31744
- Proper Divisor Sum (Aliquot Sum)
- 15469
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7200
- Möbius Function
- 0
- Radical
- 3255
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 159
- 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^3 + n^2 + n.at n=25A027444
- Base 6 digits are, in order, the first n terms of the periodic sequence with initial period 2,0,3.at n=5A037620
- Sums of 3 distinct powers of 5.at n=28A038475
- Numbers k such that the sum of the squares of the divisors of k is divisible by k.at n=27A046762
- Triangle T(n,k) of series-reduced (or homeomorphically irreducible) labeled graphs with n nodes and k edges, k=0..binomial(n,2).at n=51A060514
- Number of permutations satisfying i-3<=p(i)<=i+5, i=1..n.at n=8A072855
- Partial sums of first m composite numbers arising in A053781.at n=9A073262
- a(n) = Sum_{i=1..n} LookAndSay(i).at n=24A079664
- a(n) = 6*4^n - 12*3^n + 7*2^n - 1.at n=6A091347
- Triangle P, read by rows, that satisfies [P^7](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(7*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(0,k)=1 and P(k,k)=1 for all k>=0.at n=11A111830
- Number of partitions of 6*7^n into powers of 7, also equals column 1 of triangle A111830, which shifts columns left and up under matrix 7th power.at n=3A111831
- Number of partitions of n such that the largest part is a multiple of the smallest part.at n=35A117086
- a(n) = 6*a(n-5) - a(n-10) + 98 with a(0)=0, a(1)=11, a(2)=35, a(3)=56, a(4)=104, a(5)=147, a(6)=204, a(7)=336, a(8)=455, a(9)=731.at n=18A118554
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,k+n} having excedance set {1,2,...,k} (the empty set for k=0), 0 <= k <= n-1.at n=39A136126
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,k+n} having excedance set {1,2,...,k} (the empty set for k=0), 0 <= k <= n-1.at n=41A136126
- Integral quotients of products of consecutive composites divided by their sums: sums (divisors).at n=32A141091
- T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and without fixed points.at n=32A144089
- Values of n such that the expression sqrt(4!*(n+1) + 1) yields a perfect power.at n=9A144854
- Double q-form product triangle:q=2;c(n,q)=Product[(1 - q^i)*(1 - q^(i - 1)), {i, 2, n}];t(n,m,q)=c(n,q)/(c(m,q)*c(n-m,q)).at n=17A173884
- Double q-form product triangle:q=2;c(n,q)=Product[(1 - q^i)*(1 - q^(i - 1)), {i, 2, n}];t(n,m,q)=c(n,q)/(c(m,q)*c(n-m,q)).at n=18A173884