11788
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23632
- Proper Divisor Sum (Aliquot Sum)
- 11844
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 0
- Radical
- 5894
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 99
- 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
- Numbers k whose decimal representation, read as a base-12 value and divided by k, yields an integer.at n=9A032555
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=42A050036
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=42A050052
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=42A050068
- Triangle T(n,k) read by rows; given by [0,1,0,1,0,1,0,1,...] DELTA [1,1,1,2,1,3,1,4,1,5,1,6,...], where DELTA is Deléham's operator defined in A084938.at n=43A085838
- Number of base 18 circular n-digit numbers with adjacent digits differing by 5 or less.at n=4A125381
- Fast "exotic addition" a o b = [ a[1]+b[1], a[1]*b[2]+a[2]*b[1] ].at n=28A175841
- Number of right isosceles triangles that can be formed from the n^2 points of n X n grid of points (or geoboard).at n=12A187452
- Costas arrays such that the corresponding permutation is connected.at n=12A213339
- a(n) = A216951(n)/2.at n=44A216952
- The hyper-Wiener index of the Bethe cactus lattice graph D_n defined pictorially in the Hosoya - Balasubramanian reference.at n=2A221043
- The Wiener index of the zig-zag polyhex nanotube TUHC_6[2n,2] defined pictorially in Fig. 1 of the Eliasi et al. reference.at n=12A227703
- Number of Hamiltonian cycles in the undirected simple graph G_n with vertices 1,...,n which has an edge connecting vertices i and j if and only if |i-j| is prime.at n=12A228626
- Expansion of 3 * q^(1/3) * phi(q) * psi(q^6) / c(q) in powers of x where phi(), psi() are Ramanujan theta functions and c() is a cubic AGM theta function.at n=34A233037
- Row sums of triangle in A139040.at n=41A238383
- Number of distinct graceful labelings of trees with n vertices.at n=9A337274
- Number of partitions of n into 5 or more distinct parts.at n=47A347572
- Expansion of e.g.f. -LambertW(x^2 * (1 - exp(x)))/2.at n=8A355179
- Smallest k >= 10 whose decimal representation read in base (n+10) is a multiple of k.at n=1A378024