5907
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 2733
- 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
- 3560
- Möbius Function
- -1
- Radical
- 5907
- Omega Function (Ω)
- 3
- 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
- 124
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of partitions of floor(5n/2)-1 into n nonnegative integers each no more than 5.at n=30A001976
- Expansion of 1/(1-2*x^2-3*x^3).at n=15A002447
- a(n) = 3 + n/2 + 7*n^2/2.at n=41A006124
- Row sums of A026584.at n=10A026596
- Minimal m such that n^n-m and n^n+m are both primes, or -1 if there is no such m.at n=26A075468
- Row sums of the triangle in A122820.at n=32A077388
- A077388 sorted and duplicates removed.at n=36A082638
- a(n) = floor(5^n/3^n).at n=17A094974
- Ceiling((Pi/e)^n).at n=60A121279
- Smallest sum of n consecutive odd primes which is a multiple of n.at n=32A132810
- Row sums of triangle A136573.at n=7A136574
- Number of n X n binary arrays, symmetric about both diagonal and antidiagonal, with every 1 adjacent to at least one other 1, but at most one 1 adjacent horizontally and at most one 1 adjacent vertically.at n=7A144056
- a(n) = numerator of polynomial of genus 1 and level n for m = 3.at n=5A145658
- 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, 0, 1), (0, 1, -1), (1, -1, -1), (1, 0, 0)}.at n=10A148082
- 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, 0, 1), (0, 0, 1), (0, 1, -1), (0, 1, 0), (1, -1, 1)}.at n=7A150205
- a(n+1)-+a(n)=prime, a(n+1)*a(n)=Average of twin prime pairs, a(1)=3,a(2)=10.at n=10A154496
- a(n) = 49*n^2 - 2*n.at n=10A157362
- Catalan pseudoprimes: odd composite integers n=2*m+1 satisfying A000108(m) == (-1)^m * 2 (mod n).at n=0A163209
- Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=11A166776
- Inverse permutation to A190126.at n=5A190127