11541
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15392
- Proper Divisor Sum (Aliquot Sum)
- 3851
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7692
- Möbius Function
- 1
- Radical
- 11541
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence for sigma-CrFe, Position Xa.at n=27A009962
- Sum of primes between n and n^2.at n=18A109818
- Records in A111229.at n=32A111270
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 1, -1), (1, -1, 1), (1, 1, 0)}.at n=8A149224
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (1, -1, 1), (1, 0, -1), (1, 1, 0)}.at n=8A149438
- 1/8 the number of (n+1)X3 0..3 arrays with all 2X2 subblock sums the same.at n=5A184022
- 1/8 the number of (n+1)X7 0..3 arrays with all 2X2 subblock sums the same.at n=1A184026
- T(n,k)=1/8 the number of (n+1)X(k+1) 0..3 arrays with all 2X2 subblock sums the same.at n=22A184029
- T(n,k)=1/8 the number of (n+1)X(k+1) 0..3 arrays with all 2X2 subblock sums the same.at n=26A184029
- Number of n X 3 0..2 arrays with every 1 immediately preceded by 0 to the left or above, and every 2 immediately preceded by both a 1 and a 0.at n=4A203366
- Number of nX5 0..2 arrays with every 1 immediately preceded by 0 to the left or above, and every 2 immediately preceded by both a 1 and a 0.at n=2A203368
- T(n,k)=Number of nXk 0..2 arrays with every 1 immediately preceded by 0 to the left or above, and every 2 immediately preceded by both a 1 and a 0.at n=23A203371
- T(n,k)=Number of nXk 0..2 arrays with every 1 immediately preceded by 0 to the left or above, and every 2 immediately preceded by both a 1 and a 0.at n=25A203371
- Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=9A207107
- a(n) is the least value of k such that the decimal expansion of n^k contains nine consecutive identical digits.at n=40A217164
- Number of idempotent 3 X 3 0..n matrices of rank 1.at n=40A224525
- Number of subsets of {1,...,n} containing n and having at least one set partition into 5 blocks with equal element sum.at n=10A248114
- Number of intersection points when every pair of vertices of a row of n adjacent congruent rectangles are joined by an infinite line.at n=14A347750
- Number of distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.at n=13A360350
- Expansion of 1 / Sum_{k in Z} x^(2*k) / (1 - x^(5*k+2)).at n=45A375061