12675
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 22692
- Proper Divisor Sum (Aliquot Sum)
- 10017
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- 0
- Radical
- 195
- Omega Function (Ω)
- 5
- 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
- 55
- 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
- no
- Odd
- yes
Appears in sequences
- Number of nodes in regular n-gon with all diagonals drawn.at n=24A007569
- Number of intersection points of diagonals of an n-gon in general position, plus number of vertices.at n=25A014626
- Numbers k such that k^2 is palindromic in base 8.at n=40A029805
- Base 8 palindromes that start with 3.at n=24A043023
- Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).at n=36A046347
- Numbers k such that the sum of the digits of k equals the sum of the prime divisors of k.at n=43A070275
- Number of legal positions in Go played on an n X n grid (each group must have at least one liberty).at n=2A094777
- Numbers n that are the hypotenuse of exactly 12 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 12 ways.at n=3A097226
- Products x*y*z arising from A102495.at n=22A102509
- Triangle T, read by rows, that satisfies: T(n,k) = [T^3](n-1,k) for n>k+1>=1, with T(n,n) = 1 and T(n+1,n) = n+1 for n>=0, where T^3 is the matrix cube of T.at n=49A109282
- a(n) = number of solutions to the Diophantine equation x+y^2+z^3=n^4 with positive x,y,z.at n=17A121876
- a(n) = 36*n^2 - 17*n + 2.at n=18A157265
- Number of n X n arrays of squares of integers with every 5X5 subblock summing to 4.at n=0A159203
- Number of n X n arrays of squares of integers summing to 4.at n=3A159355
- Number of triangles that can be built from rods with lengths 1,2,...,n by using and concatenating all rods.at n=36A160455
- Nonnegative numbers n such that 6*2^n-1 is prime.at n=30A164523
- Number of lattice paths from (0,0) to (n,n) using steps S={(1,0),(0,1),(r,r)|0<r<=2} that never go above the line y=x.at n=7A175934
- a(n) = n*(17*n - 13)/2.at n=39A180232
- Successive integers produced by Conway's PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=29A183132
- Numbers n such that the sum of prime factors of n (counted with repetition) equals three times the largest prime divisor.at n=37A212861