11050
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 23436
- Proper Divisor Sum (Aliquot Sum)
- 12386
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 2210
- Omega Function (Ω)
- 5
- 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
- 130
- 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
- Let T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (A049429, A049430); sequence gives Sum_{d} T(n,d).at n=7A005519
- a(n) = n*(n+1)*(2*n+1)/3.at n=25A006331
- Coordination sequence for {A_4}* lattice.at n=13A008531
- a(n) = 1*(n) + 2*(n-1) + 3*(n-2) + ... + (n+1-k)*k, where k = floor((n+1)/2).at n=49A023855
- a(n) = 1*(n+1-1) + 2*(n+1-2) + ... + k*(n+1-k), where k = floor((n+1)/2).at n=48A023856
- Numbers that are the sum of 2 nonzero squares in exactly 6 ways.at n=2A025289
- Numbers that are the sum of 2 nonzero squares in 5 or more ways.at n=5A025296
- Numbers that are the sum of 2 nonzero squares in 6 or more ways.at n=2A025297
- Numbers that are the sum of 2 distinct nonzero squares in exactly 6 ways.at n=2A025307
- Numbers that are the sum of 2 distinct nonzero squares in 5 or more ways.at n=4A025315
- Numbers that are the sum of 2 distinct nonzero squares in 6 or more ways.at n=2A025316
- Number of (s(0), s(1), ..., s(2n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 3, s(2n) = 3. Also T(2n,n), where T is defined in A026022.at n=8A026029
- T(n,[ n/2 ]), where T is defined in A026022.at n=16A026034
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=31A031947
- a(n) = (2*n - 1)*(3*n + 1).at n=43A033569
- Schoenheim bound L_1(n,6,5).at n=20A036833
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) < cn(3,5).at n=70A036863
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=31A049357
- T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r.at n=39A050157
- Numbers k such that k | sigma_6(k).at n=35A055710