12293
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 667
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11628
- Möbius Function
- 1
- Radical
- 12293
- 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
- 112
- 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
- Numbers that are the sum of 11 positive 11th powers.at n=6A004822
- Crystal ball sequence for diamond.at n=24A007904
- a(n) = n*(17*n + 1)/2.at n=38A022275
- Numbers k such that 45*2^k+1 is prime.at n=20A032372
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 18.at n=50A050967
- Number of partitions of n in which number of parts is not 2.at n=34A058984
- Triangle read by rows in which row n lists n+1 terms, starting with n, such that the difference between successive terms is equal to n^4 - 1.at n=39A162622
- Triangle read by rows in which row n lists n terms, starting with n, such that the difference between successive terms is equal to n^4 - 1 = A123865(n).at n=31A162623
- Triangle read by rows in which row n lists n terms, starting with n^4 + n - 1, such that the difference between successive terms is equal to n^4 - 1 = A123865(n).at n=30A162624
- Number of (n+2) X 4 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=18A190026
- Number of 5's in the last section of the set of partitions of n.at n=45A206555
- Table read by antidiagonals of numbers of form (2^n - 1)*2^(m+3) + 5 where n>=1, m>=1.at n=46A224701
- Number of nX4 0..1 arrays with every element equal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=11A298656
- a(0) = 1 by convention; for n>0, a(n) is the number of points in the n-th figure shown in A255011 (meaning the figure with 4n points on the perimeter).at n=7A331449
- Triangle read by rows: T(n,m) (n >= m >= 1) = number of vertices formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares.at n=27A331453
- Index position of {2}^n within the list of partitions of 2n in canonical ordering.at n=17A332706
- Number of integer partitions of n into three or more parts or into two equal parts.at n=34A349801
- Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of vertices in the resulting planar graph.at n=29A367322
- a(n) = 3*2^n + 5*(-1)^n.at n=12A369404