15345
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 29952
- Proper Divisor Sum (Aliquot Sum)
- 14607
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7200
- Möbius Function
- 0
- Radical
- 5115
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- Sums of consecutive noncubes.at n=5A048396
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a rotation of order 2.at n=10A053171
- One half of the number of non-self-conjugate balanced partitions.at n=57A067772
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly two ways.at n=8A076455
- a(n) = n*(n - 1)*(n + 2)/2.at n=30A077414
- Sign twisted convoluted convolved Fibonacci numbers H_j^(6).at n=10A089102
- Numbers n which when converted to base 4, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.at n=3A091078
- Terms of A094302 without repetition.at n=37A094426
- Terms of A094302 which are not squarefree, without repetition.at n=3A094427
- Number of compositions of n where the smallest part is greater than or equal to the number of parts.at n=44A098131
- a(n) = a(n-1) + a(n-2), starting with 110, 211.at n=10A120727
- a(n) = 16*n^2 - n.at n=30A157446
- a(n) = 961*n^2 - 31.at n=3A158679
- The non-repetitive Kaprekar binary numbers in decimal.at n=33A163205
- Sum of a positive square and a positive cube in at least three ways.at n=25A171385
- Numbers n such that phi(n) = phi(n+7), with Euler's totient function phi = A000010.at n=21A179189
- Number of ways to place n nonattacking semi-bishops on an n X n board.at n=4A187235
- a(n) = n*(14*n + 3).at n=33A195025
- G.f.: A(x) = 1 + Sum_{n>=1} x^(n^2) * ((1-x)^n + 1/(1-x)^n).at n=44A197707
- Number of n X 4 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=9A207064