5975
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7440
- Proper Divisor Sum (Aliquot Sum)
- 1465
- 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
- 4760
- Möbius Function
- 0
- Radical
- 1195
- 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
- no
- 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
- no
- Odd
- yes
Appears in sequences
- If x and y are terms, so is x*y + 9.at n=34A009350
- Composite n such that phi(n) * sigma(n) is one less than a square.at n=33A015709
- Odd composite n such that phi(n) * sigma(n) is one less than a square.at n=13A015722
- Numbers having period-2 6-digitized sequences.at n=17A031357
- Numbers beginning and ending with their multiplicative digital root.at n=31A064704
- Non-palindromic solutions to sigma(R(n)) = sigma(n), where R = A004086 is digit-reversal.at n=8A085329
- Least positive multiples of index n that can result from the self-convolution of a monotonically increasing sequence (A087148).at n=44A087149
- Numbers k such that (2^31-1)*(6^k) - 1 is prime.at n=13A098883
- Sum of the odd composites A071904 less than or equal to 1+2*10^n.at n=1A134229
- a(n) = prime(2*n^2) - 2*n^2.at n=20A141086
- 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, -1), (-1, -1, 1), (-1, 0, 1), (0, 1, 0), (1, -1, 0)}.at n=10A148121
- Numbers k such that k^2 == 2 (mod 23^2).at n=22A156849
- Coefficient triangle sequence of characteristic polynomials of a Fermat like matrix:M(n)=Eulerian n-th matrix: F(n)=M(n).Transpose[M(n)]].at n=19A168242
- a(n) = ceiling(A003269(n)/2).at n=32A173674
- Numbers k such that Mordell's equation y^2 = x^3 - k has exactly 10 integral solutions.at n=13A179169
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,3,4,1 for x=0,1,2,3,4.at n=18A196205
- Number of nondecreasing sequences of 3 1..n integers with no element dividing the sequence sum.at n=35A212870
- Triangle read by rows: number of circular permutations of [1..n] with k modular progressions of rise 1, distance 1 and length 3 (n >= 3, 0 <= k <= n).at n=51A216722
- Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 2 X n array.at n=33A220154
- Numbers that end in (..., 175, 175, 175, ...) under the rule: next term = product of the last four digits in the sequence so far.at n=34A239721