15304
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 28710
- Proper Divisor Sum (Aliquot Sum)
- 13406
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7648
- Möbius Function
- 0
- Radical
- 3826
- 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
- 84
- 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
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047030.at n=15A047031
- Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors (excluding the proper divisor 1). Rearrangements which cause leading zeros are excluded.at n=9A086248
- 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, 0, 0), (0, 1, 1), (1, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=7A150880
- Consider the base-3 Kaprekar map n->K(n) defined in A164993. Sequence gives numbers belonging to cycles, including fixed points.at n=11A164998
- Consider the base-3 Kaprekar map n->K(n) defined in A164993. Sequence gives numbers belonging to cycles of length greater than 1.at n=7A165000
- Consider the base-3 Kaprekar map n->K(n) defined in A164993. Sequence gives least elements of each cycle, including fixed points.at n=7A165002
- Consider the base-3 Kaprekar map n->K(n) defined in A164993. Sequence gives least elements of each cycle of length > 1.at n=3A165004
- Smallest member of cycle corresponding to n-th term of A165009.at n=7A165010
- Number of -n..n arrays x(0..3) of 4 elements with sum zero and with zeroth through 3rd differences all nonzero.at n=14A200040
- Number of (n+2) X 9 0..2 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..2 introduced in row major order.at n=8A204283
- Number of n X 5 0..1 arrays with every element equal to 1, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=7A298060
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=70A298063
- Number of ways 1/n can be expressed as the sum of five distinct unit fractions: 1/n = 1/p + 1/q + 1/r + 1/s + 1/t, with 0 < p < q < r < s < t.at n=2A347566
- The number of five-term Egyptian fractions of rational numbers, x/y, 0 < x/y < 1, ordered as below. The sequence is the number of (p,q,r,s,t) such that x/y = 1/p + 1/q + 1/r + 1/s + 1/t where p, q, r, s, and t are integers with p < q < r < s < t.at n=1A349085
- The number of five-term Egyptian fractions of rational numbers, x/y, 0 < x/y < 1, ordered as below. The sequence is the number of (p,q,r,s,t) such that x/y = 1/p + 1/q + 1/r + 1/s + 1/t where p, q, r, s, and t are integers with p < q < r < s < t.at n=11A349085
- The number of five-term Egyptian fractions of rational numbers, x/y, 0 < x/y < 1, ordered as below. The sequence is the number of (p,q,r,s,t) such that x/y = 1/p + 1/q + 1/r + 1/s + 1/t where p, q, r, s, and t are integers with p < q < r < s < t.at n=30A349085