15416
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)
- 14824
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7360
- Möbius Function
- 0
- Radical
- 3854
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 53
- 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
- Numbers n such that phi(n) = sigma(n) - sigma(n+1).at n=2A063943
- Numbers k such that phi(k) divides sigma(k+1) - sigma(k).at n=39A072611
- A014486-encoding of binary trees whose left and right subtree are identical.at n=9A083939
- The sum of a triangular array made from a negative 6-fold permutation product.at n=14A105156
- a(n) = prime(n) * Sum_{i=1..n} prime(i).at n=14A143215
- Triangular recursive sequence: a(n,k)=(n - k + 1)A(n - 1, k - 1) + (k)* A(n - 1, k) - 18*A(n - 2, k - 1).at n=49A153489
- Triangular recursive sequence: a(n,k)=(n - k + 1)A(n - 1, k - 1) + (k)* A(n - 1, k) - 18*A(n - 2, k - 1).at n=50A153489
- a(n) is the smallest integer k such that the n-th (backward) difference of the partition sequence A000041 is positive from k onwards.at n=30A155861
- Number of (n+2)X(2+2) 0..1 arrays with every 3X3 subblock diagonal median plus antidiagonal median nondecreasing horizontally and vertically.at n=1A258904
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal median plus antidiagonal median nondecreasing horizontally and vertically.at n=4A258910
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 470", based on the 5-celled von Neumann neighborhood.at n=13A282421
- a(n) = n * Sum_{k prime<=n} k.at n=46A301707
- a(n) is the least number k for which A330437(k) = n.at n=26A330704