15349
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
- 2
- Divisor Sum
- 15350
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15348
- Möbius Function
- -1
- Radical
- 15349
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1793
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of n-node rooted trees of height 7.at n=14A000418
- Number of parts in all partitions of n into distinct parts.at n=47A015723
- Numbers k such that the continued fraction for sqrt(k) has period 67.at n=16A020406
- Convolution of Fibonacci F(n+1), n>=0, with F(n+5), n>=0.at n=12A067333
- Numerators of Pi-independent part of even terms in the probability of obtaining an acute triangle by picking n points at random in the unit n-ball.at n=6A093758
- Primes arising as A093929(n)*A093929(n+1)+2.at n=29A093930
- Primes congruent to 15 mod 41.at n=39A142212
- Primes congruent to 41 mod 43.at n=37A142290
- Primes congruent to 27 mod 47.at n=40A142378
- Primes congruent to 12 mod 49.at n=39A142424
- Primes congruent to 32 mod 53.at n=32A142562
- Primes congruent to 9 mod 59.at n=31A142736
- Primes congruent to 38 mod 61.at n=31A142836
- Irregular triangle of coefficients of p(n, x) = (1 - x^2)^(n+1)*Sum_{j >= 0} (4*j+ 1)^n*x^(2*j), read by rows.at n=33A158782
- Numbers k such that 6*prime(k) -+ {1,5} are all prime.at n=23A174393
- Triangle read by rows, coefficients of the generalized Eulerian polynomials A_{n, 4}(x) in descending order.at n=16A225118
- Primes p such that f(f(p)) is prime where f(x) = x^8 + 1.at n=31A236070
- Number of (2n+1)-node rooted trees of height n.at n=7A245103
- Number of (n+1) X (1+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0001 0101 0111.at n=7A259508
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111.at n=28A259515