11230
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20232
- Proper Divisor Sum (Aliquot Sum)
- 9002
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4488
- Möbius Function
- -1
- Radical
- 11230
- Omega Function (Ω)
- 3
- 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
- 68
- 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
- Number of pure 2-complexes on 6 unlabeled nodes with n multiple 2-simplexes.at n=9A050911
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=42A090495
- After the first two terms, each subsequent term is the smallest integer that is an outlier of the previous dataset, based on the criterion of 3 sample standard deviations above the mean.at n=42A103231
- Indices of prime Padovan numbers: values of k such that A000931(k+5) is prime.at n=22A112882
- Smallest number containing exactly n distinct numbers in its decimal representation.at n=13A120005
- a(n) = A007318 * [1, 6, 14, 9, 0, 0, 0, ...].at n=19A143690
- Number of reduced words of length n in the Weyl group D_7.at n=14A162210
- Number of reduced words of length n in the Weyl group D_7.at n=28A162210
- Number of binary strings of length n with no substrings equal to 0000 0101 or 1011.at n=13A164435
- Describe 10^n. Also called the "Say What You See" or "Look and Say" sequence LS(10^n).at n=23A191111
- Numbers of rank 10 in the poset of lunar numbers.at n=38A191752
- Number of nX4 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=5A207342
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=41A207346
- Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=3A207350
- Number of n X 6 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=3A207772
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=39A207774
- Numbers n such that 5*6^n + 1 is prime.at n=18A247260
- Numbers n such that the smallest prime divisor of n^2+1 is 97.at n=40A248552
- Number of (n+2)X(n+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 2 and no column sum 2.at n=16A255220
- L(p) modulo p^2, where p = prime(n) and L is a Lucas number (A000032).at n=44A268478