15367
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17024
- Proper Divisor Sum (Aliquot Sum)
- 1657
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13860
- Möbius Function
- 0
- Radical
- 1397
- Omega Function (Ω)
- 3
- 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
- 177
- 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
- a(n) = (8*n+1)*(8*n+7).at n=15A001533
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=40A024848
- Sum of terms in row n of A081532.at n=34A081533
- a(n) = (6*n+1)*(6*n+7).at n=20A085026
- Partial sums of A165271.at n=35A165273
- Number of nondecreasing sequences of n 1..6 integers with every element dividing the sequence sum.at n=32A212534
- Numbers k such that sigma(k - 2) = sigma(k + 2).at n=20A223091
- Number of second differences of arrays of length 4 of numbers in 0..n.at n=38A228219
- a(n) = A050376(n)*A050376(n+1) where A050376(n) is the n-th number of the form p^(2^k) with p is prime and k >= 0.at n=36A240521
- Sum of divisors of the minimal numbers (A007416).at n=32A256259
- a(n) = 10*n^2 + 4*n + 1.at n=39A272039
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 589", based on the 5-celled von Neumann neighborhood.at n=24A273113
- Records in A249860.at n=45A276705
- Numbers k such that k![14]-2 is prime, where k![14] is the fourteen-fold multifactorial.at n=54A284190
- The tenth Euler transform of the sequence with g.f. 1+x.at n=6A290359
- Number of 6-leaf rooted trees with n levels.at n=10A290360
- Least integer k in A031443 such that k*n is also in A031443, or -1 if there is no such k.at n=35A358857
- Number of vertices among all distinct circles that can be constructed from n equally spaced points along a line using only a compass.at n=15A359252
- a(n) = A000203(A036966(n)), the sum of divisors of the n-th cubefull number A036966(n).at n=40A362986