12929
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14784
- Proper Divisor Sum (Aliquot Sum)
- 1855
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11076
- Möbius Function
- 1
- Radical
- 12929
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 138
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numbers k such that Fib(k) == -13 (mod k).at n=42A023167
- Euler transform of 3 2 1 1 1 1 1 1...at n=18A029859
- Irregular array where the n-th row are the divisors, not occurring earlier in the sequence, of the sum of the terms in all previous rows. a(1)=2.at n=47A120576
- Numbers k such that Sum_{j=1..k} phi(j)^j == 0 (mod k).at n=10A229209
- a(n) = 384*n + 257.at n=33A229855
- Number of partitions of (2, n) into a sum of distinct pairs.at n=33A268345
- Floor(r*a(n-1)) - floor(r*a(n-2)), where r = 3/2, a(0) = 1, a(1) = 1.at n=49A275865
- Semiprime numbers whose digit string can be partitioned into three parts such that the product of the first two parts equals the third part.at n=22A280636
- Number T(n,k) of permutations p of [n] such that min_{j=1..n} |p(j)-j| = k; triangle T(n,k), n >= 0, 0 <= k <= floor(n/2), read by rows.at n=33A299789
- a(n) is the number of vertices formed by n-secting the angles of an octagon.at n=35A335770
- Numbers that are the sum of five fourth powers in three or more ways.at n=7A344243
- Numbers that are the sum of five fourth powers in exactly three ways.at n=7A344244
- a(n) = Sum_{1 <= i <= j <= k <= n} gcd(i,j,k).at n=36A344521
- Index of prime(n) in A353709, or -1 if prime(n) does not appear in A353709.at n=51A353719
- a(n) = Sum_{k=0..floor(n/2)} binomial(n-2*k,floor(k/3)).at n=42A376695