11472
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 29760
- Proper Divisor Sum (Aliquot Sum)
- 18288
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3808
- Möbius Function
- 0
- Radical
- 1434
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- 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
- Coordination sequence for lattice D*_8 (with edges defined by l_1 norm = 1).at n=5A035473
- Base numbers of 9-gonal palindromic numbers.at n=13A055560
- McKay-Thompson series of class 12d for Monster.at n=26A058492
- McKay-Thompson series of class 24A for Monster.at n=26A058571
- Antidiagonal sums of square array A082011.at n=15A082014
- Row sums of triangle A128567.at n=6A128602
- Expansion of x/((1-x)^2(1+x-x^3-x^4-x^5-x^6-x^7+x^9+x^10)).at n=45A143611
- Partial sums of A002522, starting at n=1.at n=31A145066
- 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, 0, 1), (0, 0, 1), (1, -1, 0), (1, 1, -1)}.at n=9A148461
- a(n) = A170803(n-1) + 2, with a(0) = 1, a(1) = 2.at n=21A170805
- The number of permutations p of {1,...,n} such that |p(i)-p(i+1)| is in {3,4} for all i from 1 to n-1.at n=27A174706
- Number of 0..3 arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors.at n=5A200881
- T(n,k) is the number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors.at n=33A200886
- Number of 0..n arrays x(0..7) of 8 elements without any interior element greater than both neighbors.at n=2A200891
- Number of nX1 0..3 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.at n=8A203094
- T(n,k) = number of n-element 0..3 arrays with each element the minimum of k adjacent elements of a random 0..3 array of n+k-1 elements.at n=43A217954
- T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors.at n=36A231586
- T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal, vertical and antidiagonal neighbors.at n=36A231700
- T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal and vertical neighbors.at n=36A231746
- T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.at n=36A231839