6025
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7502
- Proper Divisor Sum (Aliquot Sum)
- 1477
- 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
- 4800
- Möbius Function
- 0
- Radical
- 1205
- 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
- 93
- 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
- Generalized Lucas numbers.at n=12A006492
- Numbers k such that the continued fraction for sqrt(k) has period 17.at n=32A020356
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 5.at n=31A031418
- a(n)=T(n,n), array T as in A049735.at n=31A049740
- 22-gonal numbers: a(n) = n*(10*n-9).at n=25A051874
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.at n=8A065903
- Floor( e * (3/2)^n ).at n=19A081225
- a(n) = sum of the first n upper twin primes.at n=26A086168
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 5 and 6.at n=38A136888
- Numbers k such that the continued fraction of (1 + sqrt(k))/2 has period 15.at n=28A146338
- 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, 0), (-1, 0, 1), (0, 0, -1), (1, -1, 0), (1, 1, 1)}.at n=7A149771
- Numbers k such that the string k modulo 1000 is found at position k in the decimal digits of Pi.at n=19A153226
- a(n) = sum_{i+j+k=n} (-1)^k*binomial(3*i+2*j+k,k) * (i/(2*j+i)) * binomial(2*j+i,j) *2^(i+j) * Catalan(i).at n=6A153233
- Positive numbers y such that y^2 is of the form x^2+(x+167)^2 with integer x.at n=8A159777
- Numbers n such that the sum of the prime factors with multiplicity of n divides n-1.at n=43A175729
- Numbers that are the product of two odd numbers x*y such that 2^x (mod y) = 2^y (mod x) = 2.at n=41A176970
- Number of (n+2) X 6 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=13A190028
- Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=18A229439
- Integers k such that A231589(k) = floor(k*(k-1)/4) - k.at n=44A231791
- E.g.f. satisfies: A'(x) = A(x)^4 / A(-x) with A(0) = 1.at n=5A235345