12088
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 10592
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6040
- Möbius Function
- 0
- Radical
- 3022
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 94
- 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
- Generalized Fibonacci numbers A_{n,2}.at n=30A006207
- Number of partitions in parts not of the form 19k, 19k+3 or 19k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=38A035972
- E.g.f.: exp(3x)/(1-3x)^(1/3).at n=5A094822
- Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 2 and repeat; as m = 1,2,3,.. the remaining terms form this sequence.at n=31A112560
- a(n) = Fibonacci(n) mod n^3.at n=41A132636
- A triangle sequence of general recursive Sierpinski-Pascal minus general Narayana with adjusted n,m levels and zeros out:k=2; t(n,m)=Pascal(n,m,k-1)-Narayana(n-1,m-1,2*(k-1)).at n=21A155834
- A triangle sequence of general recursive Sierpinski-Pascal minus general Narayana with adjusted n,m levels and zeros out:k=2; t(n,m)=Pascal(n,m,k-1)-Narayana(n-1,m-1,2*(k-1)).at n=25A155834
- The smallest magic constant of an n X n magic square with distinct prime entries.at n=13A164843
- Sequence by greedy construction satisfying Lucier-Sárközy difference set condition.at n=49A174911
- Partial sums of A033485.at n=35A178855
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=38A181882
- a(n) is the sum of all distinct integers that can be produced by reversing the digits of n in any base b >= 2.at n=49A211518
- Least k such that k*30^n-1 , k*30^n+1, and 2*k*30^n-1 are prime; that is, twin primes and a Sophie Germain prime.at n=18A212956
- Number of (n+2)X(3+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 2 and no column sum 2.at n=18A255223
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 798", based on the 5-celled von Neumann neighborhood.at n=27A273571
- a(n) = A289671(n)/2^f(n), where f(n) = 2*floor((n-1)/3) + ((n+2) mod 3) = A004523(n).at n=39A289677
- a(n) = A289677(3*n+1).at n=13A290439
- a(1) = 4; for n > 1, a(n) is the least positive number not yet in the sequence such that Sum_{k=1..n} a(k) divides Sum_{k=1..n} a(k)^3.at n=38A318359
- a(n) is the number of edges formed in a square by dividing each of its sides into n equal parts giving a total of 4*n nodes and drawing straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n.at n=38A335351
- Numbers that are the sum of five third powers in exactly ten ways.at n=38A345188