12950
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 28272
- Proper Divisor Sum (Aliquot Sum)
- 15322
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 2590
- Omega Function (Ω)
- 5
- 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
- Expansion of Molien series for 8-dimensional real Clifford group 2^{1+6}.Alt_8.2 of genus 3 and order 5160960.at n=49A024186
- a(n) = binomial(n,4) + binomial(n,2).at n=24A055795
- a(n)=phi(n^2+1)/n if (n^2+1) is composite and phi(n^2+1)==0 (mod n).at n=31A067926
- Indices of primes in sequence defined by A(0) = 97, A(n) = 10*A(n-1) + 17 for n > 0.at n=14A101018
- a(n) is the smallest unused number such that the RMS (Root Mean Square) of a(1) through a(n) is an integer.at n=42A141391
- a(n) = RMS( A141391(1) through A141391(n) ).at n=41A141392
- a(n) = RMS( A141391(1) through A141391(n) ).at n=42A141392
- a(n) = C(3,n) DELTA C(0,n).at n=31A147724
- -10-Knödel numbers.at n=47A225514
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=29A245209
- Number of (n+1) X (6+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=4A250781
- Number of (5+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=5A250787
- Number of length n arrays of permutations of 0..n-1 with each element moved by -3 to 3 places and the median of every three consecutive elements nondecreasing.at n=10A263592
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 54", based on the 5-celled von Neumann neighborhood.at n=32A270024
- Numbers k such that k/10 + 1 is a square.at n=36A302576
- Number of integers in base n having exactly three distinct digits such that the number formed by the consecutive subsequence of the initial j digits is divisible by j for all j in {1,2,3}.at n=44A333405
- Main diagonal of array in A358304, divided by 2.at n=31A358307
- Numbers k such that A360119(k) > 1, but which have no divisors d > 1 such that d+1 is also a divisor.at n=30A360129
- Number of subsets of {1..n} without all distinct lengths of maximal runs (increasing by 1).at n=14A384176
- Primitive terms of A388028.at n=38A388030