11312
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 25296
- Proper Divisor Sum (Aliquot Sum)
- 13984
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 1414
- 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
- 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
- Numerators of continued fraction convergents to sqrt(837).at n=4A042616
- Numbers whose base-4 representation contains exactly four 0's and two 3's.at n=32A045083
- Multiples of 8 with digit sum 8.at n=32A069543
- Array in which the n-th row contains the multiples of n using nonzero digits and having a digit sum of n. Sequence contains the rows and a zero entry for rows with no terms (e.g. 10).at n=36A077755
- Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges and k leaves.at n=30A091320
- Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times.at n=9A099771
- Least positive k such that k * [RSA-200]^n - 1 is prime, where RSA-200 is the 200 decimal digit RSA challenge number A391940(15).at n=7A108375
- Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments.at n=25A108914
- Triangular T(n,k) which contains in column k >= 0 the elements of the Stirling transform of the unsigned sequence Stirling1(j+k,j), j >= 0.at n=23A118984
- Coefficients in a q-analog of the function [LambertW(-2x)/(-2x)]^(1/2), as a triangle read by rows.at n=28A152550
- An unrestricted partition statistic: sum of A179864 over row n.at n=20A179862
- Numbers whose product of digits is 6.at n=36A199988
- Composite numbers whose product of digits is 6.at n=24A201055
- Numbers that eventually reach 1 under "x -> sum of 4th power of digits of x".at n=9A219111
- Number of (n+1)X(5+1) 0..2 arrays with the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=7A237634
- Number of n X 6 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 3.at n=18A239359
- One half of numbers representable in at least two different ways as sums of four nonvanishing cubes. See A259060 for these numbers and their representations.at n=7A261241
- Intersection of A003052 and A283002.at n=21A283003
- Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A299810
- Number of nX6 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A299812