11421
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17472
- Proper Divisor Sum (Aliquot Sum)
- 6051
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7452
- Möbius Function
- 0
- Radical
- 141
- Omega Function (Ω)
- 6
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Odd numbers divisible by exactly 6 primes (counted with multiplicity).at n=37A046319
- Numbers whose product of decimal digits equals its sum of binary digits.at n=20A064003
- Numbers k such that |2^k - k^5| is prime.at n=12A075981
- Expansion of 1/(1-3x-3x^3).at n=8A089978
- a(n) = prime(n)^2 - n.at n=27A182174
- Numbers with digital product = 8.at n=43A199989
- Composite numbers whose product of digits is 8.at n=32A201056
- Number of (n+1)X(n+1) -10..10 symmetric matrices with every 2X2 subblock having sum zero and one or three distinct values.at n=6A211815
- Number of (w,x,y,z) with all terms in {1,...,n} and w+y=|x-y|+|y-z|.at n=28A212677
- Number of n X 3 0..3 arrays with no more than floor(n X 3/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=6A222611
- Number of nX7 0..3 arrays with no more than floor(nX7/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=2A222615
- T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=38A222616
- T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=42A222616
- a(n) = Sum_{i=0..n} digsum_6(i)^3, where digsum_6(i) = A053827(i).at n=58A231674
- a(n) = Sum_{i=0..n} digsum(i)^3, where digsum(i) = A007953(i).at n=36A231688
- Number of odd terms in f^n, where f = 1/x^2+1/x+1+x+x^2+1/y^2+1/y+y+y^2.at n=63A246314
- A246314(2^n-1).at n=6A246315
- Number of (n+1) X (3+1) 0..1 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=12A251123
- a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 0, a(2) = 3, a(3) = 1.at n=18A295856
- G.f.: A(x,y) = (1-y) * Sum_{n>=0} y^n * (1 + x*(1-y)^2)^(n^2).at n=85A303920