12154
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18720
- Proper Divisor Sum (Aliquot Sum)
- 6566
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5916
- Möbius Function
- -1
- Radical
- 12154
- 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
- 156
- 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
- yes
- Odd
- no
Appears in sequences
- Generalized Stirling numbers, [n+5,5]_3.at n=4A001712
- Coordination sequence for CaF2(1), F position.at n=37A009924
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=42A015850
- Numbers k such that the continued fraction for sqrt(k) has period 98.at n=14A020437
- Fourth elementary symmetric function of 3,4,...,n+5.at n=2A024185
- Number of partitions satisfying (cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=37A036801
- Generalized Stirling number triangle of first kind.at n=23A049458
- Numbers k such that k + sum_of_digits(k) is a cube.at n=20A084661
- Unsigned 3-Stirling numbers of the first kind.at n=23A143492
- Base-6 Keith numbers.at n=15A188197
- a(n) = n*(14*n + 13) + 3.at n=29A195029
- Table of elementary symmetric function a_k(3,4,...,n+2) (no 1 and 2).at n=25A196845
- Number of nondecreasing -n..n vectors of length 3 whose dot product with some other -n..n vector equals 3.at n=20A226342
- a(0) = 16, after which, if a(n-1) = product_{k >= 1} (p_k)^(c_k), then a(n) = (1/2) * (1 + product_{k >= 1} (p_{k+1})^(c_k)), where p_k indicates the k-th prime, A000040(k).at n=22A246344
- a(n) is the smallest nonnegative integer such that a(n)! contains a string of exactly n consecutive 0's, not including trailing 0's.at n=8A252652
- Number of length 3 1..(n+2) arrays with no leading or trailing partial sum equal to a prime.at n=35A254206
- Partition the j digits of n into blocks of k, with 1 <= k <= j-1, starting at left and multiply. Sum of these numbers equals n.at n=7A275171
- Triangle T(n, k) = [x^n] (n + k + x)!/(k + x)! for 0 <= k <= n, read by rows.at n=23A325137
- Numbers k such that k + sum of digits of k is a proper prime power.at n=52A342773
- a(1)=1, a(2)=6; for n > 2, a(n) is the smallest unused positive number such that gcd(a(n-1)+n, a(n)) > 1, gcd(a(n-1), a(n)) > 1, and gcd(n, a(n)) > 1.at n=58A349492