15310
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27576
- Proper Divisor Sum (Aliquot Sum)
- 12266
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6120
- Möbius Function
- -1
- Radical
- 15310
- Omega Function (Ω)
- 3
- 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
- 84
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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 that are the sum of 8 positive 7th powers.at n=42A003375
- Numbers k such that the continued fraction for sqrt(k) has period 90.at n=37A020429
- Triangular array associated with Schroeder numbers.at n=43A033878
- a(n) = n*3^n + 1.at n=7A050914
- Interprimes which are of the form s*prime, s=10.at n=31A075285
- T(n, k) counts Schroeder n-paths whose ascent starting at the initial vertex has length k. Triangle T(n,k), read by rows.at n=37A132372
- 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, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=9A148867
- Numbers k such that (sum of base-2 digits of k) = (sum of base-10 digits of k) = 10.at n=27A152207
- a(n) = 729*n + 1.at n=20A158397
- a(n) = 7*3^n + 1.at n=7A199110
- Expansion of Product_{k>=1} (1 - x^(10*k))/(1 - x^k).at n=36A261776
- Number of (n+1)X(5+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=2A262417
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=23A262420
- Number of (3+1) X (n+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=4A262422
- Number of connected Cayley graphs on n nodes.at n=23A327754
- Moran numbers whose arithmetic derivative is also a Moran number (A001101).at n=17A349485
- Number of ways to tile a 1 X n strip using squares, red dominos, and blue dominos, where the number of red dominos must be twice the number of blues.at n=18A383952