12276
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 34944
- Proper Divisor Sum (Aliquot Sum)
- 22668
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3600
- Möbius Function
- 0
- Radical
- 2046
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 63
- Smith Number
- no
- 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
- Number of trees of diameter 4.at n=34A000094
- a(n) = floor(n*phi^15), where phi is the golden ratio, A001622.at n=9A004930
- a(n) = round(n*phi^15), where phi is the golden ratio, A001622.at n=9A004950
- Representation degeneracies for boson strings.at n=35A005291
- Number of 2n-bead black-white reversible complementable strings with n black beads and fundamental period 2n.at n=9A045631
- Rhombi (in 3 different orientations) in a rhombus with 60-degree acute angles.at n=30A052153
- Triangle of numbers arising in enumeration of walks on square lattice.at n=26A052175
- Triangle of numbers arising in enumeration of walks on square lattice.at n=48A052176
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the six simple ratios of musical harmony: 6/5, 5/4, 4/3, 3/2, 8/5 and 5/3.at n=21A054540
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to four of the simple ratios of musical harmony: 5/4, 4/3, 3/2 and 8/5.at n=24A060525
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of 8 musical tones: 8/7 16/11 5/4 4/3 3/2 8/5 11/8 7/4.at n=39A060527
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of two tones of musical harmony: the perfect 4th, 4/3 and its complement the perfect 5th, 3/2.at n=20A060528
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the 11 pairs of target ratios needed to express the 22 steps of the theoretical Hindu scale known as the 22 Srutis: 45/32 and 64/45, 27/20 and 40/27, 4/3 and 3/2, 81/64 and 128/81, 5/4 and 8/5, 6/5 and 5/3, 32/27 and 27/16, 9/8 and 16/9, 10/9 and 9/5, 16/15 and 15/8, 256/243 and 243/128.at n=40A061921
- Square roots of terms in A065611.at n=4A065612
- Expansion of 1/(sqrt(1-4*x)*sqrt(1-8*x)).at n=5A098410
- A Jacobsthal-Pascal triangle.at n=47A124860
- A Jacobsthal-Pascal triangle.at n=52A124860
- Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^12 = I.at n=13A166467
- a(n) is the smallest positive number B that yields a solution for k = A167219(n).at n=28A167221
- Triangle read by rows: T(n,k) is the number of cycle-up-down permutations of {1,2,...,n} having k fixed points (0 <= k <= n). A permutation is said to be cycle-up-down if it is a product of up-down cycles. A cycle (b(1), b(2), ...) is said to be up-down if, when written with its smallest element in the first position, it satisfies b(1) < b(2) > b(3) < ... .at n=47A186363