11332
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 19838
- Proper Divisor Sum (Aliquot Sum)
- 8506
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5664
- Möbius Function
- 0
- Radical
- 5666
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(1) = 1; for n>1, a(n)= smallest number greater than the previous term such that a(n-1)*a(n) + 1 is a palindrome.at n=13A081941
- A Chebyshev transform of 2^n.at n=21A090412
- Numbers of polypentagons with one internal vertex (see Cyvin et al. for precise definition).at n=12A122744
- Triangle related to super-Catalan numbers (or little Schroeder numbers).at n=41A130743
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 4 and 8.at n=29A136971
- 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, 1), (-1, 1, -1), (0, 0, 1), (1, -1, 0), (1, 0, -1)}.at n=11A148021
- Values n such that n and n+1 are both in A037073.at n=32A173167
- The number of permutations p of {1,...,n} such that |p(i)-p(i+1)| is in {2,3,4,5} for all i from 1 to n-1.at n=9A174705
- Number of n X 5 binary arrays without the pattern 0 0 0 antidiagonally or horizontally.at n=2A188870
- T(n,k)=Number of nXk binary arrays without the pattern 0 0 0 antidiagonally or horizontally.at n=23A188874
- Number of 3Xn binary arrays without the pattern 0 0 0 antidiagonally or horizontally.at n=4A188875
- Numbers of rank 10 in the poset of lunar numbers.at n=50A191752
- Number of binary "privileged words" of length n.at n=19A231208
- Number of partitions of n for which 2*(number of distinct parts) <= (number of parts).at n=36A237363
- Zeroless numbers n with digits d_1, d_2, ... d_k such that d_1^3 + ... + d_k^3 is a cube.at n=35A254960
- Indices of primes in the 10th-order Fibonacci number sequence, A127194.at n=27A257073
- Number of nX5 0..1 arrays with each 1 adjacent to 3 or 6 king-move neighboring 1s.at n=10A296310