12830
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23112
- Proper Divisor Sum (Aliquot Sum)
- 10282
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5128
- Möbius Function
- -1
- Radical
- 12830
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = sum of lengths of strings that can be generated by any starting string of n 2's and 3's, using the rule described in the Comments lines.at n=9A094005
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 1), (0, -1), (1, -1), (1, 1)}.at n=11A151414
- Number of binary strings of length n with no substrings equal to 0000 0110 or 1001.at n=14A164439
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=36A229467
- Smallest even k such that the pair {k-3,k-1} is not a twin prime pair and lpf(k-1) > lpf(k-3) >= prime(n), where lpf = least prime factor (A020639).at n=23A242720
- Smallest even k such that the pair {k-3,k-1} is not a twin prime pair and lpf(k-1) > lpf(k-3) >= prime(n), where lpf = least prime factor (A020639).at n=24A242720
- Least even k such that sfdf(k-1) > sfdf(k-3) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490), and k-3 is not the lesser of a pair of Fermi-Dirac twin primes (A229064).at n=29A244412
- Least even k such that sfdf(k-1) > sfdf(k-3) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490), and k-3 is not the lesser of a pair of Fermi-Dirac twin primes (A229064).at n=30A244412
- Expansion of Product_{k>=0} 1/(1-x^(4*k+1))^4.at n=20A261636
- Numbers m such that the decimal digits of m are exactly the same as those of all the indices corresponding to the prime factors of m.at n=13A287916
- Numbers k such that (44*10^k - 719)/9 is prime.at n=16A295968