12089
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15168
- Proper Divisor Sum (Aliquot Sum)
- 3079
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9360
- Möbius Function
- -1
- Radical
- 12089
- Omega Function (Ω)
- 3
- 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
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Number of partitions of n into parts 3k and 3k+1 with at least one part of each type.at n=49A035618
- Numerator sequence of mean length of certain stackings of n+1 squares on a double staircase.at n=13A055245
- a(n) = floor(8^n/5^n).at n=20A094985
- Numbers k such that 21^k - 2 is a prime.at n=18A128461
- 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, 1, 1), (0, 1, 1), (1, -1, 1), (1, 1, -1)}.at n=8A149027
- a(n) = 100*n^2 - n.at n=10A157659
- a(n) = 121*n^2 - 11.at n=9A158539
- a(n) = (2*n^3 + 5*n^2 + 21*n)/2.at n=21A162266
- Numbers k that divide 10^(k+1)-1.at n=37A175203
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=38A181884
- a(n) = 8*n^2 + 14*n + 5.at n=38A181890
- Number of cyclotomic cosets of 11 mod 10^n.at n=38A220021
- Number of (n+2) X (3+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 1 and no column sum 1.at n=18A257442
- a(n)=least number m such that gcd(prime(m)+2,prime(m+1)+2) = 2*n-1.at n=10A268863
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 313", based on the 5-celled von Neumann neighborhood.at n=25A271202
- Numbers k such that (28*10^k + 191)/3 is prime.at n=25A273042
- Indices of primes followed by a gap (distance to next larger prime) of 42.at n=32A320719
- The difference between 10^n and the lesser of the twin primes immediately before.at n=39A327133
- Number of nonempty sets {p_1, p_2, ..., p_k} such that Product_{i=1..k} p_i divides Product_{i=1..k} (n + p_i), where the p_i are distinct primes.at n=65A334127
- Number of ways to write n as an ordered sum of 7 nonprime numbers.at n=27A341484