11368
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 25650
- Proper Divisor Sum (Aliquot Sum)
- 14282
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4704
- Möbius Function
- 0
- Radical
- 406
- Omega Function (Ω)
- 6
- 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
- 37
- 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
- Pentagonal pyramidal numbers: a(n) = n^2*(n+1)/2.at n=28A002411
- Number of labeled connected graphs with n nodes and 0 cutpoints (blocks or nonseparable graphs).at n=5A013922
- Even pentagonal pyramidal numbers.at n=21A015224
- a(n) = n*(27*n + 1)/2.at n=29A022285
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 23 ones.at n=4A031791
- Triangle of coefficients of ordered cycle-index polynomials: T(n,k) = binomial(n,k)*Bell(k)*Bell(n-k).at n=42A033306
- Triangle of coefficients of ordered cycle-index polynomials: T(n,k) = binomial(n,k)*Bell(k)*Bell(n-k).at n=38A033306
- Numerators of continued fraction convergents to sqrt(79).at n=6A041140
- Least k for which the integers Floor(k/(m*(m+1))) for m=1,2,...,n are distinct.at n=31A054061
- a(n) = Sum_{i = 1..n} (n - i)^(1 + i).at n=8A062809
- Number of atoms in cluster of n layers around C_60.at n=14A063498
- a(n) = 4n^3 + 2n^2.at n=13A089207
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A071655/A071656.at n=10A089414
- Numbers n such that p(n),p(n)+6,p(n)+12,p(n)+18 are consecutive primes and p(n)=6*k+1 for some k, where p(n) denotes n-th prime.at n=22A090838
- Triangle read by rows, T(n, k) = Sum_{j=0..n} C(n-j, n-k)*E2(n, j), where E2 are the second-order Eulerian numbers A201637, for n >= 0 and 0 <= k <= n.at n=24A112493
- Fourth column of triangle A112493 used for e.g.f.s of Stirling2 diagonals.at n=3A112496
- Numbers of polypentagons with one internal vertex (see Cyvin et al. for precise definition).at n=12A122745
- Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2)).at n=28A124324
- Partial sum of irregular primes A000928.at n=33A132360
- The sum of all the entries in an n X n Cayley table for multiplication in Z_n.at n=28A160255