15604
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 28224
- Proper Divisor Sum (Aliquot Sum)
- 12620
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7544
- Möbius Function
- 0
- Radical
- 7802
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 146
- 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
- Denominators of continued fraction convergents to sqrt(789).at n=8A042521
- Indices of primes in sequence defined by A(0) = 57, A(n) = 10*A(n-1) - 23 for n > 0.at n=16A101580
- Cascadence of (1+2x)^2; a triangle, read by rows of 2n+1 terms, that retains its original form upon convolving each row with [1,4,4] and then letting excess terms spill over from each row into the initial positions of the next row such that only 2n+1 terms remain in row n for n>=0.at n=29A120914
- Number of (n+1) X (2+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=3A235192
- Number of (n+1) X (4+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=1A235194
- T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=11A235198
- T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=13A235198
- Least positive integer m with prime(m)+2 and prime(prime(m))+2 both prime such that prime(m*n)+2 and prime(prime(m*n))+2 are both prime.at n=50A259487
- Numbers k such that (2*10^k - 143)/3 is prime.at n=20A281992
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) -1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=42A294867
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=7A304666
- Numbers that are the sum of nine fourth powers in ten or more ways.at n=33A345594
- Numbers that are the sum of nine fourth powers in exactly ten ways.at n=27A345852
- Product_{n>=1} (1 + a(n)*x^n) = Sum_{n>=0} Bell(n)*x^n, where Bell = A000110.at n=8A353831
- Product_{n>=1} 1 / (1 - a(n)*x^n) = Sum_{n>=0} Bell(n)*x^n, where Bell = A000110.at n=8A353944
- a(n) is the number of squarefree semiprimes <= 2^n.at n=16A358078