15379
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19040
- Proper Divisor Sum (Aliquot Sum)
- 3661
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12168
- Möbius Function
- 0
- Radical
- 91
- Omega Function (Ω)
- 4
- 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
- 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
- Number of nonseparable toroidal tree-rooted maps with n + 2 edges and n + 1 vertices.at n=11A006414
- Number of 3-voter voting schemes with n linearly ranked choices.at n=24A007009
- Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1 <= k <= n; sequence gives f(n,n-2)/n.at n=11A019579
- a(n) = n*(n - 1)^3/2.at n=14A019582
- Distinct odd elements in 3-Pascal triangle A028262 (by row).at n=36A028268
- Odd elements (greater than 1) to right of central elements in 3-Pascal triangle A028262.at n=33A028274
- Terms of A072390 (sums of two powers of 13) divided by 2.at n=13A073220
- Numbers k such that A074037(k) = A002034(k).at n=22A074055
- Triangle, read by rows, where T(n,k) = Sum_{j=0..k} T(n-1,j)*(j+1)*[(k+1)*(k+2)/2 - j*(j+1)/2] for n>k>0, with T(0,0)=1 and T(n,n) = T(n,n-1) for n>0.at n=17A102400
- Composite numbers whose exponents in their canonical factorization lie in the geometric progression 1, 3, 9, ...at n=16A102838
- Numbers of the form (7^i)*(13^j).at n=13A108056
- Numbers n such that F(2*n - 1) is prime, where F(m) is a Fibonacci number.at n=27A117595
- a(n) = ((n-th prime)^5-(n-th prime)^3)/24.at n=5A138438
- Numbers having exactly two distinct prime factors p, q with q = p+6.at n=37A143205
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 0, 1), (-1, 1, 0), (1, 0, 0)}.at n=10A148525
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (0, -1, 0), (0, 1, 1), (1, 1, -1)}.at n=9A148834
- Composite Flavius' numbers (A000960) whose prime factors are again Flavius' numbers.at n=12A181489
- Number of (n+2) X 3 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.at n=34A184540
- Numbers n with property that the largest proper divisor of n is a cube.at n=33A187104
- Number of length n+2 0..11 arrays with no consecutive three elements summing to more than 11.at n=2A241617