12737
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13056
- Proper Divisor Sum (Aliquot Sum)
- 319
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12420
- Möbius Function
- 1
- Radical
- 12737
- 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
- 107
- 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
- Number of ordered quadruples of integers from [ 2,n ] with no common factors between triples.at n=25A015639
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=36A020425
- Expansion of x/((1 - x - x^4)*(1 - x)^7).at n=10A145136
- 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), (0, 1, 0), (1, 0, 0)}.at n=8A149976
- Number of nX3 arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX3 array.at n=8A219811
- a(n) = floor((10*n^3 + 63*n^2 + 126*n + 89) / 72).at n=43A254874
- Records in A002945 (continued fraction expansion of cube root of 2).at n=8A268515
- Numbers n such that A003144(n) = floor(alpha*n) + 1, where alpha = 1.839... is the positive real zero of x^3-x^2-x-1.at n=0A275158
- Numbers n such that A003145(n) = floor(alpha^2*n)+1, where alpha = 1.839... is the positive real zero of x^3-x^2-x-1.at n=40A278352
- Numbers n such that A003146(n) = floor(alpha^3*n)+1, where alpha = 1.839... is the positive real zero of x^3-x^2-x-1.at n=10A278353
- Number of (not necessarily connected) graceful graphs on n edges with no isolated points.at n=10A308544
- a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero n-gonal numbers in exactly n ways, or 0 if no such integer exists.at n=39A350207