12715
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15264
- Proper Divisor Sum (Aliquot Sum)
- 2549
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10168
- Möbius Function
- 1
- Radical
- 12715
- 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
- 55
- 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
- The q expansion of Lambda^5, a Hauptmodul for Gamma_1(5).at n=24A078905
- Numbers k such that k and k^2 use only the digits 1, 2, 5, 6 and 7.at n=37A137004
- a(n) = 44*n^2 - 1.at n=16A158628
- Number of (n+2) X 4 0..2 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..2 introduced in row major order.at n=8A204278
- Number of inequivalent connected planar figures that can be formed from n 1 X 2 rectangles (or dominoes) such that each pair of touching rectangles shares exactly one edge, of length 1, and the adjacency graph of the rectangles is a tree.at n=6A216492
- Numbers n such that the decimal expansions of both n and n^2 have 1 as smallest digit and 7 as largest digit.at n=31A257210
- a(n) is the greatest integer such that binomial(a(n),n)*2^(1 - binomial(n,2)) < 1.at n=21A279032
- Number of nX4 0..1 arrays with every element unequal to 2 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=12A303632
- Number of complete necklace compositions of n.at n=17A325786
- Start with two vertices and draw a circle around each whose radius is the distance between the vertices. The sequence gives the number of regions constructed after n iterations of drawing circles with this same radius around every new vertex created from all circles' intersections.at n=50A374337
- Numbers k such that the least m for which m*k is a ludic number (if such an m exists) sets a new record.at n=12A378051