12264
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
- 4
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 35520
- Proper Divisor Sum (Aliquot Sum)
- 23256
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 3066
- 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
- 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
- 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
- a(n) = A027052(n, 2n-1).at n=11A027056
- Numbers k such that 121*2^k+1 is prime.at n=12A032410
- Numerators of continued fraction convergents to (sqrt(37)-4)/3.at n=12A082962
- a(n) = 2*a(n-1) + 5*a(n-2), with a(0) = 0, a(1) = 3.at n=8A083695
- A014486-indices of A083932-trees.at n=24A083934
- a(n) = A062402(2^n+1).at n=12A096856
- Consider iteration of the function f(x) = sigma(phi(x)) = A062402(x). Sequence lists the numbers k such that the trajectory of k returns to k.at n=32A096998
- A062402(x)=sigma(phi[x]) function is iterated; initial value=2^n; a(n)=largest term of trajectory.at n=10A097001
- Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k nonroot nodes of degree 1.at n=30A101449
- Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k branches.at n=33A101452
- Determinants of 3 X 3 matrices of discrete blocks of 9 consecutive primes.at n=10A117329
- Row sums of triangle A120072 (numerator triangle for H atom spectrum).at n=34A120074
- Number of base 14 circular n-digit numbers with adjacent digits differing by 6 or less.at n=4A125402
- a(n) = n*(7*n-2).at n=42A135703
- 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, 0, 0), (0, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=9A148803
- 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), (0, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=8A150121
- Number of UUDUDD's starting at level 0 in all Dyck paths of semilength n with no UUU's and no DDD's (U=(1,1), D=(1,-1)).at n=14A166297
- Triangle read by rows: T(n, m) = binomial(n, m)* Sum_{k=0..m} binomial(n, k) for 0 <= m <= n.at n=41A167024
- a(n) = sigma(n!!) where n!! is A006882(n).at n=10A167367
- The fifth row of the ED1 array A167546.at n=5A167548