15272
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 14968
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7216
- Möbius Function
- 0
- Radical
- 3818
- Omega Function (Ω)
- 5
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Maximal coefficient of Product_{k<=n} (1 + x^k). Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0 or 1.at n=20A025591
- a(n) = d(n)/2, where d = A026040.at n=42A026041
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 13 ones.at n=28A031781
- Base 3 digital convolution sequence.at n=20A033640
- Number of fair distributions (equal sum) of the integers {1,..,4n} between A and B = number of solutions to the equation {+-1 +-2 +- 3 ... +-4*n = 0}.at n=5A060468
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 7 (most significant digit on right).at n=12A061936
- Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0.at n=20A063865
- Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0 or +- 1.at n=20A063867
- Sum of the first n safe primes.at n=29A066869
- Sum of squares of digits of n is equal to the largest prime factor of n.at n=39A074302
- Number of integer partitions of n with a part dividing all the other parts.at n=36A083710
- Sum of first n 8-almost primes.at n=13A086061
- Inverse Moebius transform of Lucas numbers (A000032) 1,3,4,7,11,..at n=19A100107
- Number of 3 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally.at n=45A188554
- Number of involutions avoiding the pattern 1324.at n=12A230554
- Number of (n+2)X(n+2) 0..2 arrays with no increasing sequence of length 3 horizontally, vertically or antidiagonally downwards.at n=0A233594
- Number of (n+2)X(1+2) 0..2 arrays with no increasing sequence of length 3 horizontally, vertically or antidiagonally downwards.at n=0A233595
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no increasing sequence of length 3 horizontally, vertically or antidiagonally downwards.at n=0A233602
- Number of (1+2)X(n+2) 0..2 arrays with no increasing sequence of length 3 horizontally, vertically or antidiagonally downwards.at n=0A233603
- Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape I; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=50A247703