15795
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 30576
- Proper Divisor Sum (Aliquot Sum)
- 14781
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7776
- Möbius Function
- 0
- Radical
- 195
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- Degrees of irreducible representations of Suzuki group Suz.at n=14A003902
- Number of ordered rooted trees with n non-root nodes and all outdegrees <= five.at n=10A036767
- Numbers whose base-5 representation contains exactly three 0's and three 1's.at n=30A045172
- Odd numbers divisible by exactly 7 primes (counted with multiplicity).at n=13A046320
- A convolution triangle of numbers generalizing Pascal's triangle A007318.at n=17A049327
- Numbers k such that 2*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=15A056702
- Denominators of coefficients of asymptotic expansion of probability p(n) (see A002816) in powers of 1/n.at n=13A078631
- a(n) = Sum_{k=0..floor(n/2)} binomial(n,2*k)*J(k), where J = A001045.at n=13A101892
- Number of different ways to select n elements from three sets of n elements such that there is at least one element from each set.at n=5A115246
- Coordination sequence for 6-dimensional cyclotomic lattice Z[zeta_9].at n=9A126899
- a(n) = sum of cubes of first n odd primes.at n=6A133548
- a(n) = ((2^b-1)/phi(n))*Sum_{d|n} Moebius(n/d)*d^(b-1) for b = 4.at n=26A160892
- q-expansion of modular form psi_0^4/t_{3B}.at n=24A198956
- Number of defective 3-colorings of an n X 2 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=6A229600
- Number of defective 3-colorings of an n X 7 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=1A229605
- T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=29A229606
- T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=34A229606
- T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=34A229637
- Number of defective 3-colorings of a 7 X n 0..2 array connected horizontally, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.at n=1A229643
- Number of partitions p of n such that the number of parts is a part and max(p) - min(p) is not a part.at n=48A241384