11210
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21600
- Proper Divisor Sum (Aliquot Sum)
- 10390
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4176
- Möbius Function
- 1
- Radical
- 11210
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 99
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=38A015850
- Consider the sequence b(k) such that b(k) and sigma(b(k)) end with the same digit in base 10. Sequence gives values of b(k) such that b(k)/k = 10.at n=19A065255
- Multiples of 5 with digit sum 5.at n=29A069540
- Totally balanced decimal numbers: if we assign the weight w(d) = d-1 to each digit d (i.e., w(0) = -1, w(1) = 0, ..., w(9) = 8) and then read the digits of the term from left to right, the partial sum of the weights is never negative and the total weighted sum is zero.at n=25A071154
- "Lazy binary" representation of n. Also called redundant binary representation of n.at n=34A089591
- n(k) is the minimum n that requires at least k to make 2*Prime[n]+Prime[n-k] a prime.at n=50A114237
- 10 times A007623.at n=35A124252
- Least number k > (2n-1) such that (2n-1)^k - 2 is prime, or 0 if no such number exists.at n=60A133856
- Triangle T(n,k) read by rows: number of k X k triangular matrices with nonnegative integer entries and without zero rows or columns such that sum of all entries is equal to n, n>=1, 1<=k<=n.at n=40A137251
- a(n) = A000043(n) - 3.at n=21A139480
- Numbers encoded in an alternate, sometimes more compact, binary system with a third, dual-purpose, prefix/delimiter symbol not always required.at n=12A140116
- Numbers divisible by the sum of 4th powers of their digits.at n=34A169665
- Numbers n such that sum of squares of factorials of digits of n is a power of 2.at n=36A174570
- a(2*n) = 10*a(n), a(2*n+1) = a(n) + a(n+1).at n=33A178569
- a(n) = n*(n^3+n^2+2*n+1).at n=10A186636
- Number of nondecreasing arrangements of n+2 numbers in 0..n with the last equal to n and each after the second equal to the sum of one or two of the preceding three.at n=30A190034
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=21A191111
- Numbers of rank 11 in the poset of lunar numbers.at n=10A191753
- Łukasiewicz words (without the last zero) for rooted plane trees where non-leaf branching can occur only at the leftmost branch of any level, but nowhere else.at n=29A209644
- Number of segments needed to draw (on the infinite square grid) a diagram of regions and partitions of n.at n=29A211026