11748
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 18492
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3520
- Möbius Function
- 0
- Radical
- 5874
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- 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
- Number of loopless tree-rooted planar maps with 3 vertices and n faces and no isthmuses.at n=10A006428
- Maximal self-dual antichains on n points.at n=6A007363
- Numbers k such that phi(k) = phi(k - phi(k)).at n=44A051487
- a(n) = n(n+7)(n+1)(n^2+2n+12)/120.at n=14A051746
- Numbers k such that sigma(k) divides sigma(sigma(k)).at n=31A066961
- Number of mobiles (cycle rooted trees) with n nodes and 2-colored internal (non-leaf) nodes.at n=8A108531
- 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, 0, 1), (0, 0, -1), (1, -1, 1), (1, 1, 0)}.at n=8A149369
- a(n) = the smallest positive integer that, when written in binary, contains both binary n and binary n^2 as substrings.at n=21A165820
- The sum of the elements within a jump in a Sieve of Eratosthenes table.at n=23A179545
- Number of nondecreasing arrangements of n+2 numbers in 0..6 with the last equal to 6 and each after the second equal to the sum of one or two of the preceding four.at n=41A189323
- Numbers n>1 that divide the sum of their divisors and anti-divisors.at n=17A240746
- Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k UHU configurations, where U=(0,1), H(1,0); (n>=2, k>=0).at n=38A273896
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=15A294550
- a(n) is the least k such that A295520(k) = n.at n=33A295793
- Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).at n=19A353365
- The number of regions formed when every pair of n points, placed at the vertices of a regular n-gon, are connected by a circle and where the points lie at the ends of the circle's diameter.at n=15A358782
- a(n) = Sum_{k=0..floor(n/3)} binomial(4*n-3*k-1,n-3*k).at n=5A371771