13568
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 27594
- Proper Divisor Sum (Aliquot Sum)
- 14026
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6656
- Möbius Function
- 0
- Radical
- 106
- Omega Function (Ω)
- 9
- 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
- 19
- 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
- 5-morphic but not bimorphic, automorphic nor trimorphic.at n=46A056036
- Numbers k such that k^4 == 1 (mod 5^5).at n=17A056102
- Consider all Pythagorean triples (X,X+7,Z); sequence gives X values.at n=15A076296
- Maximal coefficient (in absolute value) of the minimal polynomial P with integer coefficients such that P(sin(Pi/n)) = 0.at n=27A081797
- Number of 3 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (10;0) and (01;1).at n=8A100312
- Triangle P, read by rows, that satisfies [P^2](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(2*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(k,k)=1 and P(k+2,2)=P(k+2,0) for k>=0.at n=28A111975
- Triangle P, read by rows, that satisfies [P^2](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(2*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(k,k)=1 and P(k+2,2)=P(k+2,0) for k>=0.at n=29A111975
- Triangle P, read by rows, that satisfies [P^2](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(2*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(k,k)=1 and P(k+2,2)=P(k+2,0) for k>=0.at n=30A111975
- Column 0 of triangle A111975, which shifts columns left and up under matrix square.at n=7A111976
- The values of 'a' in a^2 + b^2 = c^2 where b - a = 7 and gcd(a,b,c)=1.at n=9A117474
- Triangle T(n, k) = ( k*(n-k+1) )^3 - 2^(n-1), read by rows.at n=39A141388
- Triangle T(n, k) = ( k*(n-k+1) )^3 - 2^(n-1), read by rows.at n=41A141388
- a(n) = ((3+2*sqrt(2))*(4+sqrt(2))^n + (3-2*sqrt(2))*(4-sqrt(2))^n)/2.at n=5A163604
- Products of the 8th power of a prime and a distinct prime (p^8*q).at n=15A179668
- Monotonic ordering of set S generated by these rules: if x and y are in S and x^2-y^2>0 then x^2-y^2 is in S, and 2 and 3 are in S.at n=16A192648
- Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 7.at n=39A195091
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209144; see the Formula section.at n=51A209143
- Numbers n such that n^2 + 1 is divisible by a 5th power.at n=8A218564
- Number of permutations of length n containing exactly 1 occurrence of 123 and 2 occurrences of 132.at n=11A224289
- The Wiener index of the graph obtained by applying Mycielski's construction to the crown graph G(n) (n>=3).at n=29A228598