15516
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
- 18
- Divisor Sum
- 39312
- Proper Divisor Sum (Aliquot Sum)
- 23796
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5160
- Möbius Function
- 0
- Radical
- 2586
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 146
- Smith Number
- yes
- 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
- Number of partitions of floor(5n/2) into n nonnegative integers each no more than 5.at n=39A001975
- Convolution of primes with themselves.at n=21A014342
- Multiplicity of highest weight (or singular) vectors associated with character chi_116 of Monster module.at n=39A034504
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 3.at n=15A038634
- Numbers which are the sum of their proper divisors containing the digit 5.at n=25A059464
- Number of parts if 3^n is partitioned into parts of size 2^n as far as possible and into parts of size 1^n.at n=13A060692
- 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, 1), (0, 1, 0), (1, -1, 1), (1, 0, 0)}.at n=8A150093
- a(n) = (2*n^3 + 5*n^2 + 21*n)/2.at n=23A162266
- Number of 3 X 3 magilatin squares with positive values < n.at n=8A173548
- Number of 0..n arrays x(0..3) of 4 elements with each no smaller than the sum of its previous elements modulo (n+1).at n=16A200253
- Floor of sums of the cubes of the non-integer square roots of n, as partitioned by the integer roots: floor(Sum_{j=n^2+1..(n+1)^2-1} j^(3/2)).at n=9A247112
- Numbers k such that (29*10^k - 41)/3 is prime.at n=24A275284
- Number of 5-cycles in the n-triangular honeycomb queen graph.at n=6A289706
- Expansion of Product_{1 <= i_1 <= i_2 <= i_3 <= i_4} (1 + x^(i_1*i_2*i_3*i_4)).at n=39A321567
- Sum of the second largest parts of the partitions of n into 9 parts.at n=37A326472
- a(0) = 1, a(n) = (1/2) * Sum_{j=1..n} (1-(-1)^j-(-2)^j) * binomial(n,j) * a(n-j) for n > 0.at n=6A370456
- Integers m such that m^4 is the sum of squares of two or more consecutive positive integers.at n=7A383359
- Integers m such that m^4 is the sum of squares of two or more consecutive integers, positive or negative.at n=13A383653
- a(n) = (n - 1) * Sum_{k=2..n} A000010(k).at n=36A385682