5956
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10430
- Proper Divisor Sum (Aliquot Sum)
- 4474
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2976
- Möbius Function
- 0
- Radical
- 2978
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 49
- 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
- Numbers k such that 8*3^k - 1 is prime.at n=14A005541
- Number of lines through exactly 4 points of an n X n grid of points.at n=29A018811
- Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=21A024850
- Draw a line through every pair of points with coordinates (x, 1) and (x', 2) with x, x' in 1..n, and then count the number of intersection points above the line y = 2.at n=16A092275
- Numbers k such that k divides the sum of the digits of k^(2k).at n=20A108859
- a(n) = a(n-1) + a(n-3) + a(n-5).at n=18A122115
- Number of errors that occur when choosing n as modulus in French INSEE code (0<n<100).at n=7A137385
- a(n) = Frobenius number for 3 successive primes = F[p(n), p(n+1), p(n+2)].at n=34A138989
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 0, -1), (1, 0, 1)}.at n=9A148668
- Records in A139251.at n=37A152768
- Transform of the finite sequence (1, 0, -1) by the T_{0,1} transformation (see link).at n=10A159340
- Vertex number of a rectangular spiral related to prime numbers. The distances between nearest edges of the spiral that are parallel to the initial edge are the prime numbers, while the distances between nearest edges perpendicular to the initial edge are all one.at n=44A160792
- Number of irreducible Boolean polynomials of degree n.at n=14A169912
- Numbers k such that k^3 divides 15^(k^2) - 1.at n=30A177915
- Number of (n+1) X 2 binary arrays with rows and columns in nondecreasing order and with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.at n=30A184063
- Number of n X n 0..3 arrays with every element neighboring horizontally or vertically both a 0 and a 1, and 2 introduced before 3 in row major order.at n=3A204294
- Number of nX4 0..3 arrays with every element neighboring horizontally or vertically both a 0 and a 1, and 2 introduced before 3 in row major order.at n=3A204297
- T(n,k)=Number of nXk 0..3 arrays with every element neighboring horizontally or vertically both a 0 and a 1, and 2 introduced before 3 in row major order.at n=24A204301
- Fibonacci sequence beginning 11, 9.at n=14A206422
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and -1<=2w+x+y<=1.at n=32A211620