15170
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28728
- Proper Divisor Sum (Aliquot Sum)
- 13558
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 1
- Radical
- 15170
- Omega Function (Ω)
- 4
- 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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Number of n-node rooted trees of height 3.at n=17A000235
- Sum of 10 nonzero 8th powers.at n=29A003388
- Difference between A000294 and the number of solid partitions of n (A000293).at n=18A007326
- a(n) = A026637(2*n, n-1).at n=7A026639
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+9 or 24k-9. Also number of partitions in which no odd part is repeated, with at most 4 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=51A036033
- Numbers that can be represented as a sum of two distinct nontrivial prime powers in three or more ways.at n=14A225104
- Numbers k that are the product of four distinct primes such that x^2+y^2 = k has integer solutions.at n=22A248712
- Numbers k such that 3*R_k - 10 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=22A256773
- Number of length-n binary sequences whose subword complexity is <= 2i, for all i.at n=16A285894
- G.f.: Sum_{k>=0} A000041(k) * x^k / Sum_{k>=0} A000009(k)^2 * x^k.at n=22A304987
- Products of four distinct primes between sphenic numbers (products of 3 distinct primes).at n=3A351382
- Exponents k where A000120(3^k) - A070939(3^k)/2 reaches a new minimum.at n=36A372097
- Distinct values of A378664(k) in the order of appearance, when k ranges over those primitively abundant numbers k for which A378664(k) is less than the largest proper divisor of k.at n=23A378740