11370
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27360
- Proper Divisor Sum (Aliquot Sum)
- 15990
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 1
- Radical
- 11370
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- yes
- Odd
- no
Appears in sequences
- Number of 5-tuples of different integers from [ 2,n ] with no global factor.at n=18A015641
- a(1) = 7; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=33A025006
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=39A031947
- Number of partitions of n in which each odd part has odd multiplicity and each even part has even multiplicity.at n=55A102247
- Numbers k such that 4*10^k + 8*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=16A103000
- Number of binary words whose (unique) decreasing Lyndon decomposition is into Lyndon words each with an odd number of 1's; EULER transform of A000048.at n=16A123916
- a(n) = 2*n*A071148(n).at n=14A177082
- Number of obtuse triangles, distinct up to congruence, on an n X n grid (or geoboard).at n=17A190022
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=37A191111
- Number of 0..7 arrays x(0..n-1) of n elements with zero n-1st difference.at n=6A200153
- Number of 0..n arrays x(0..6) of 7 elements with zero 6th difference.at n=6A200158
- Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 5 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=n-n%2, read by rows.at n=53A231145
- Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 10 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=5*floor(n/2), read by rows.at n=28A238586
- Number of (n+2) X (3+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001.at n=6A260539
- Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001.at n=2A260543
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001.at n=38A260544
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001.at n=42A260544
- Number of partitions of n such that least and largest parts are distinct and occur the same number of times.at n=43A265259
- Numbers k such that Bernoulli number B_{k} has denominator 14322.at n=12A295588
- a(n) = Sum_{k=0..n} binomial(7*k,k) / (6*k + 1).at n=5A346671