15652
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 34496
- Proper Divisor Sum (Aliquot Sum)
- 18844
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 0
- Radical
- 7826
- 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
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that 183*2^k+1 is prime.at n=31A032468
- A014486-encodings of trivalent plane trees (tpt) represented as (embedded into) a subset of general plane trees.at n=8A083936
- Triangle read by rows: T(n,k) is the number of noncrossing connected graphs on n nodes on a circle, having exactly k four-sided faces, n>=2, 0<=k<=floor(n/2)-1.at n=41A094046
- Number of squares on infinite chessboard that a knight can reach in n moves from a fixed square.at n=47A118312
- Scaled coefficients of the M. O. Rubinstein polynomials.at n=32A153359
- Vandermonde sequence using x^2 + xy + y^2 applied to (1,2,6,...,n!).at n=2A203685
- Number of n X 4 0..1 arrays avoiding 0 0 1 and 1 0 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=5A207250
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 1 0 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=41A207254
- Number of 6 X n 0..1 arrays avoiding 0 0 1 and 1 0 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=3A207257
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X 2 array.at n=26A219211
- a(n) = n*(n^2 - 3*n + 4).at n=26A242659
- Number of ballot sequences of length n having 4 largest parts.at n=10A244101
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 393", based on the 5-celled von Neumann neighborhood.at n=30A271604
- Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=24A286796
- Sum of subword complexity (number of nonempty distinct subwords) of all binary strings of length n.at n=9A340885
- Number of non-isomorphic multiset partitions of weight n satisfying a strict version of the axiom of choice.at n=10A368098
- G.f. A(x) satisfies A( x - A(x)^2/(1 - A(x)^2) ) = x.at n=6A380678
- Number of integer partitions of n that cannot be partitioned into a set (or multiset) of sets with distinct sums.at n=40A381990