12940
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 27216
- Proper Divisor Sum (Aliquot Sum)
- 14276
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5168
- Möbius Function
- 0
- Radical
- 6470
- Omega Function (Ω)
- 4
- 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
- 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
- Cupolar numbers: a(n) = (n+1)*(5*n^2 + 7*n + 3)/3.at n=19A096000
- Numbers k such that 1*k + 1, 3*k + 1, 9*k + 1, 27*k + 1 are all primes.at n=16A112041
- Expansion of solution of functional equation.at n=7A112807
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+647)^2 = y^2.at n=6A130013
- Triangle read by rows: t(n,k)=Binomial[n, k] + Binomial[k*(n - k), n].at n=40A155798
- a(1)=1. a(n+1) = Sum_{k=1..n} a(b(k,n)), where b(k,n) is the largest positive integer that, when written in binary, occurs as a substring in both binary k and binary n.at n=40A175491
- a(n+1) = a(n) + floor(a(n)/4) with a(0)=4.at n=38A182305
- Number of (w,x,y,z) with all terms in {1,...,n} and w^2<=x^2+y^2+z^2.at n=11A212093
- Number of numbers whose base 5/4 expansion (see A024634) has n digits.at n=38A245357
- Number of (n+1) X (5+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=6A258551
- Number of (7+1) X (n+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=4A258560
- Indices of primes followed by a gap (distance to next larger prime) of 40.at n=38A320718
- Triangle read by rows: T(m,n) is the number of simple paths for a Racetrack car (using von Neumann neighborhood) with initial velocity zero, going from one corner to the diagonally opposite corner on an m X n grid, 1 <= n <= m.at n=26A351108