12732
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 29736
- Proper Divisor Sum (Aliquot Sum)
- 17004
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4240
- Möbius Function
- 0
- Radical
- 6366
- Omega Function (Ω)
- 4
- 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
- 63
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Consider a 2-D cellular automaton generated by the Schrandt-Ulam rule of A170896, but confined to a semi-infinite strip of width n, starting with one ON cell at the top left corner; a(n) is the period of the resulting structure.at n=50A006447
- From variance of Fibonacci search.at n=13A006479
- Number of parts in all partitions of all the numbers in {1,2,...,n} into distinct parts.at n=32A015724
- Open 3-dimensional ball numbers (version 2): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,0,0).at n=29A053594
- T(n,k)=Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any horizontal or vertical neighbor, and containing the value n(n+1)/2-k-1.at n=39A211910
- Number of n X 3 binary arrays with top left value 1 and no two ones adjacent horizontally or vertically.at n=7A228385
- T(n,k)=Number of nXk binary arrays with top left value 1 and no two ones adjacent horizontally or vertically.at n=47A228390
- T(n,k)=Number of nXk binary arrays with top left value 1 and no two ones adjacent horizontally or vertically.at n=52A228390
- a(1)=1, a(n+1) is the smallest number m such that A244447(a(n)) < A244447(m).at n=10A246626
- Positive even numbers which are neither of the form p + 2^m + 1 nor of the form p + 2^m - 1 with p prime.at n=15A270446
- Irregular triangle read by rows: row n gives numbers of maximal chains of lengths n-1, n, n+1, ... in the Tamari lattice T_n.at n=32A282698
- a(n) is the sum of the base-b representations of n for 2 <= b <= n+1 read in base ten.at n=27A289335
- Number of irredundant sets in the n-Moebius ladder.at n=8A290509
- Number of irredundant sets in the n-prism graph.at n=8A290511
- a(n) = a(n-1) + a(n-2) + a([n/3]) + a([2n/3]), where a(0) = 1, a(1) = 2, a(2) = 3.at n=15A298345
- a(0) = 0, a(1) = 1 and a(n) = 2*a(n-1)/(n-1) + 64*a(n-2) for n > 1.at n=6A304934
- a(n) is the number of balanced-non-self-conjugate partitions of n.at n=51A331262
- Number of partitions of n with at most four part sizes.at n=39A364793
- Number of labeled connected loop-graphs with n vertices, none isolated, and at most n edges.at n=6A369197
- Number of compositions such that their set adjacent differences are a subset of {-1,1} and contain 1 as a part of the composition itself.at n=44A372647