11736
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 31980
- Proper Divisor Sum (Aliquot Sum)
- 20244
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3888
- Möbius Function
- 0
- Radical
- 978
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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 D_4 lattice.at n=9A007900
- a(n) is least k such that k and 8k are anagrams in base n (written in base 10).at n=10A023100
- Positive numbers whose product of digits is 7 times their sum.at n=28A062384
- a(n)/(n*n!) is the average number of comparisons needed to find a node in a binary search tree containing n nodes inserted in a random order.at n=5A063090
- Numbers n such that n and 2^n end with the same three digits.at n=11A067866
- A hexagonal spiral Fibonacci sequence.at n=19A094925
- Expansion of b(q^2) * c(q^6) / (b(q) * c(q^3)) in powers of q where b(), c() are cubic AGM theta functions.at n=22A123629
- Expansion of c(q^4) / c(q) in powers of q where c() is a cubic AGM theta function.at n=45A123649
- a(n) = 4*n*(floor(n^2/2)+1). For n >= 3, this is the number of directed Hamiltonian paths on the n-prism graph.at n=18A124350
- Number of base 22 n-digit numbers with adjacent digits differing by two or less.at n=5A126409
- Number of n-step self-avoiding paths on octant grid starting at octant origin.at n=13A129700
- Numbers k such that k and k^2 use only the digits 1, 3, 6, 7 and 9.at n=16A137039
- Number of (directed) Hamiltonian paths in the n-Möbius ladder graph.at n=15A137883
- Expansion of q * psi(q^2) * psi(-q^9) / (phi(-q^3) * psi(-q^3)) in powers of q where phi(), psi() are Ramanujan theta functions.at n=45A139214
- a(n) = n*(9*n+2).at n=36A147296
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, -1), (0, 1), (1, -1)}.at n=10A151434
- Number of 6X6 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=41A156389
- Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 41.at n=4A156506
- Number of reduced 3 X 3 semimagic squares with distinct nonnegative integer entries and maximum entry n.at n=10A173727
- Numbers k such that there are 2 primes between 100*k and 100*k + 99.at n=35A186394