11385
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
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22464
- Proper Divisor Sum (Aliquot Sum)
- 11079
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 0
- Radical
- 3795
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 130
- Smith Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)/8 ).at n=46A011890
- a(n) = floor(n^2/4)*(n/2).at n=45A034828
- Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).at n=35A046347
- a(n) = ceiling(n*(n+1)*(n+2)/8).at n=44A047866
- a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers.at n=22A059270
- Numbers k such that k + the reversal of k is a square.at n=40A061230
- Eighth column (r=7) of FS(5) staircase array A062985.at n=8A062990
- Ninth column of quintinomial coefficients.at n=7A064058
- Number of 5 X 5 pandiagonal magic squares with sum n.at n=7A070212
- a(1) = 1, then the smallest k > 1 such that nk + 1 is the digit reversal of k + 1, or 0 if no such number exists.at n=5A083819
- Write (sqrt(5)-1)/2 as a binary fraction; read this from left to right and whenever a 1 appears, note the integer formed by reading leftwards from that 1.at n=7A099971
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2.at n=46A102402
- The (n,r)-th term of the following triangle is T(n)-T(r) for r = 0 to n. The n-th row contains n+1 terms. T(n) = the n-th triangular number = n(n+1)/2. Sequence contains the sum of terms at a 45-degree angle.at n=44A109900
- Denominator of sum of reciprocals of first n pentatope numbers A000332.at n=42A118412
- Numbers k such that the central binomial coefficient C(2k,k) is divisible by k^2.at n=18A121943
- Numbers n for which nontrivial positive magic squares of exactly 10 different orders with magic sum n exist. For a definition of nontrivial positive magic squares, see A125005.at n=22A125017
- Ninth column of triangle A035342.at n=2A132054
- Number of at most 4-way branching ordered (i.e., plane) trees.at n=8A135413
- Eigentriangle of A085478: T(n,k) = A085478(n,k) * A125273(k).at n=40A144250
- 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, 0), (-1, 0, 1), (-1, 1, -1), (0, 1, 1), (1, 0, 0)}.at n=8A149991