13911
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18552
- Proper Divisor Sum (Aliquot Sum)
- 4641
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9272
- Möbius Function
- 1
- Radical
- 13911
- Omega Function (Ω)
- 2
- 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
- 151
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 39.at n=36A031537
- a(n) = smallest number > a(n-1) that is not a sum of exactly one power of each of the numbers 1 through n.at n=8A047871
- Numbers n such that 261*2^n-1 is prime.at n=30A050889
- Sum of a(n) terms of 1/k^(3/4) first exceeds n.at n=40A056179
- Number of nonisomorphic cyclic subgroups of the group A_n X A_n (where A_n is the alternating group of degree n).at n=49A062365
- Number of one-bit dominant primes (A095070) in range ]2^n,2^(n+1)].at n=17A095020
- Number of primes with number of 0-bits <= number of 1-bits (A095074) in range ]2^n,2^(n+1)].at n=17A095054
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 9.at n=25A136977
- Expansion of (1+147*x+1142*x^2+1717*x^3+656*x^4+60*x^5+x^6)/(1-x)^7.at n=3A160863
- Floor-Sqrt transform of the binomial coefficients binomial(3*n,n) (A005809).at n=11A192663
- a(n) is the least integer h such that there exists a Pythagorean triple whose hypotenuse is h and whose other legs z satisfy A176774(z) = n.at n=6A343981