1293
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1728
- Proper Divisor Sum (Aliquot Sum)
- 435
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 860
- Möbius Function
- 1
- Radical
- 1293
- 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
- 101
- 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
- Length of one version of Kolakoski sequence {A000002(i)} at n-th growth stage.at n=18A001083
- Number of partitions of n into parts 2, 3, 4, 5, 6, 7.at n=47A001996
- a(n) = ceiling(n*phi^9), where phi is the golden ratio, A001622.at n=17A004964
- Coordination sequence T3 for Zeolite Code MEL.at n=23A008152
- Coordination sequence T4 for Zeolite Code MOR.at n=23A008185
- a(n) = (n+1)*(n^2 +8*n +6)/6. Number of n-dimensional partitions of 4. Number of terms in 4th derivative of a function composed with itself n times.at n=17A008778
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=32A011905
- a(n) = Sum_{j=1..n} j*prime(j).at n=10A014285
- Values of n for which exp(Pi*sqrt(n)) is very close to an integer.at n=46A019296
- "Pascal sweep" for k=5: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=59A019306
- Numbers whose sum of divisors is a cube.at n=19A020477
- Numbers k such that Fibonacci(k) == 2 (mod k).at n=23A023174
- Convolution of Lucas numbers and odd numbers.at n=9A023620
- Position of 2*n^2 in A000404 (sums of 2 nonzero squares).at n=47A024517
- Sum of remainders of n mod prime(k), for k = 1,2,3,...,n.at n=41A024925
- Index of 9^n within the sequence of the numbers of the form 6^i*9^j.at n=45A025736
- Index of 10^n within the sequence of the numbers of the form 6^i*10^j.at n=44A025744
- Distinct odd elements in 3-Pascal triangle A028262 (by row).at n=42A028268
- Odd elements (greater than 1) to right of central elements in 3-Pascal triangle A028262.at n=42A028274
- a(n) = n^2 - 3.at n=34A028872