16954
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 29754
- Proper Divisor Sum (Aliquot Sum)
- 12800
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7224
- Möbius Function
- 0
- Radical
- 2422
- 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
- 84
- 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
- a(1)=1, a(n) = 25*a(n-1) + n.at n=3A014914
- Numbers whose base-7 representation contains exactly four 0's.at n=20A043396
- a(n) = (n+1)(n+2)^2*(n+3)^2*(n+4)(11n^4 + 110n^3 + 439n^2 + 820n + 600)/86400.at n=4A107965
- Triangle T(n,k) read by rows: the coefficient [x^n] of x^2/(1-(k+1)*x-x^3) in row n, columns 0 <= k <= n.at n=34A117716
- a(n) is the smallest unused number such that the RMS (Root Mean Square) of a(1) through a(n) is an integer.at n=46A141391
- a(n) = RMS( A141391(1) through A141391(n) ).at n=45A141392
- a(n) = RMS( A141391(1) through A141391(n) ).at n=46A141392
- Number of (n+3) X 4 0..1 matrices with each 4 X 4 subblock idempotent.at n=12A224561
- Number of partitions of n into distinct parts with boundary size 10.at n=32A227567
- Number of (n+1) X (4+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=10A250725
- Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=26A254904
- Composites whose prime factorization in base 3 is an anagram of the number in base 3.at n=32A260047
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=9A317692
- Expansion of Product_{k>=1} ((1 - x^k)/(1 + x^k))^(sigma(k)).at n=23A320971
- Divide the positive integers into subsets of lengths given by successive primes. a(n) is the sum of primes contained in the n-th subset.at n=26A344718
- a(n) = coefficient of x^n in A(x) such that: 1 = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)/2) * (A(x) + x^n)^(n+1).at n=9A357799
- Number of even-length integer partitions of 2n with integer mean.at n=25A361655