15772
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 27608
- Proper Divisor Sum (Aliquot Sum)
- 11836
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7884
- Möbius Function
- 0
- Radical
- 7886
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 177
- 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 the period of the continued fraction for sqrt(k) contains exactly 82 ones.at n=16A031850
- a(n) = floor(n^3 / e).at n=35A032636
- Number of graphs with n nodes and n+2 edges.at n=6A048180
- Sum of n-th antidiagonal of A082191.at n=29A082195
- Number of (n+1) X 4 binary arrays with consecutive windows of two bits considered as a binary number nondecreasing in every row and column.at n=16A202330
- Number of rooted planar binary unlabeled trees with n leaves and caterpillar index >= 3.at n=11A214198
- Number of n-digit primes that are of the form (k-2)^2 + (k-1)^2 + k^2.at n=11A218209
- Number of partitions of n^5 into fifth powers.at n=6A259794
- Number of partitions of 6^n into n-th powers.at n=4A259798
- Array read by antidiagonals upwards: T(n,k) = number of partitions of k^n into n-th powers (n>=1, k>=0).at n=61A259799
- Number of odd primitive abundant numbers with n prime factors, counted with multiplicity.at n=5A287728
- Dirichlet convolution of right-shifted Catalan numbers with A349452 (Dirichlet inverse of A011782, 2^(n-1)).at n=10A349563
- Triangle T(n,k), 1<=k<=n: column k are the coefficients of the INVERT transform of Sum_{i=1..k} i*x^i.at n=59A380886