11272
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21150
- Proper Divisor Sum (Aliquot Sum)
- 9878
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5632
- Möbius Function
- 0
- Radical
- 2818
- Omega Function (Ω)
- 4
- 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
- 86
- 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
- Numbers n such that n^2048 + 1 is prime (a generalized Fermat prime).at n=5A088361
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 3.at n=8A094803
- a(n) = 289n + 1.at n=38A158255
- Number of tilings of a 5 X n rectangle using n pentominoes of shapes P, I, N, T.at n=9A246764
- Expansion of ((sqrt(2)-1)*(-sqrt(2);x)_inf - (sqrt(2)+1)*(sqrt(2);x)_inf)/2, where (a;q)_inf is the q-Pochhammer symbol.at n=49A278296
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 214", based on the 5-celled von Neumann neighborhood.at n=26A286736
- Total number of binary digits used to write all partitions of n in binary notation.at n=20A318756
- For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u*x+v*y with u,v minimal; a(n) = sum of the values of |v|.at n=48A345433
- a(n) = Sum_{k=1..n} sigma_2(k) * floor(n/k).at n=27A356042
- Place n equally spaced points on each side of an equilateral triangle, and join each of these points by a chord to the 2*n new points on the other two sides: sequence gives number of regions in the resulting planar graph.at n=9A366486
- Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n*k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph.at n=45A367304
- Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k cylinder up to horizontal and vertical reflections by a tile that is fixed under vertical reflections but not horizontal reflections.at n=33A368255
- Numbers k such that A025487(k) and A025487(k+1) have an equal number of divisors.at n=42A375195