12862
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19800
- Proper Divisor Sum (Aliquot Sum)
- 6938
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6264
- Möbius Function
- -1
- Radical
- 12862
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 125
- 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
- Triangle T(n,k), n>=1, read by rows, where T(n,k) is the number of lattice polygons with area n and perimeter 2*k.at n=36A008855
- Coordination sequence for Cr3Si, Cr position.at n=29A009928
- a(n) = binomial(2n,n) - n; number of (weakly) increasing or decreasing maps from 1,...,n to 1,...,n.at n=8A045992
- Numbers k such that k | sigma_3(k) - phi(k)^3.at n=17A055697
- a(n) equals floor(Vc(n) - Vs(n)), where Vc(n) is the volume of the cube with side length n and Vs(n) is the volume of the sphere of diameter n.at n=29A057671
- Sum of squares of digits of n is equal to the largest prime factor of n.at n=30A074302
- Satisfies a(n)/A079159(n) = p_n, the n-th prime (n>0), a(0)=1.at n=29A079161
- a(n) = Min{x : A073124(x) = 2n}.at n=37A096480
- Largest k > 1 such that (sum of digits of k^n)*(sum of digits of k^(n+1)) = k, or 0 if no such k exists.at n=4A130181
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 1000-1111-1000 pattern in any orientation.at n=10A146420
- 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, 0), (-1, 0, -1), (1, -1, 1), (1, 1, 0), (1, 1, 1)}.at n=7A150914
- The continued fraction of the positive constant r < sqrt(3) such that the partial quotients equal the integer floor of the powers of r.at n=18A227232
- Triangle T(n,k), n>=1, 2<=k<=n+1, read by rows, where T(n,k) is the number of self-avoiding square-lattice polygons by area n and perimeter 2*k.at n=74A259857
- a(n) is the sum of the base-b representations of n for 2 <= b <= n+1 read in base ten.at n=28A289335
- Number of even parts in the partitions of n into 7 parts.at n=43A309625
- Viggo Brun's ternary continued fraction algorithm applied to { log 2, log 3/2, log 5/4 } produces a list of triples (p,q,r); sequence gives r values.at n=29A359744
- Number of integer partitions of n with fewer parts than distinct divisors of parts.at n=48A371173