5650
domain: N
Properties
Digital Properties
- Digit Count
- 4
- 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
- 10602
- Proper Divisor Sum (Aliquot Sum)
- 4952
- 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
- 2240
- Möbius Function
- 0
- Radical
- 1130
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 85
- 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
- Related to graded partially ordered sets.at n=4A001829
- Convolution of Lucas numbers and composite numbers.at n=11A023618
- Least term in period of continued fraction for sqrt(n) is 6.at n=29A031430
- Trajectory of 3 under map n->31n+1 if n odd, n->n/2 if n even.at n=7A037113
- Numerators of continued fraction convergents to sqrt(745).at n=6A042434
- Base-9 palindromes that start with 7.at n=17A043034
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=15A049895
- a(n) = 2*n^4 + 2*n^3 + 3*n^2 + 2*n + 1.at n=7A058920
- Numbers n such that the number of primes between n^2 and (n+1)^2 = the number of primes between n and Reverse(n) (inclusive).at n=16A074817
- Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of x with Ceiling[Log[x]] radius equals 6.at n=2A096517
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=16A097387
- Bond series for second perpendicular moment of Kagome lattice.at n=9A120548
- Numbers k such that k+1, k+3, k+7 and k+9 are all primes.at n=10A125855
- Largest number k for which the n-th prime is the median of the largest prime dividing the first k integers.at n=31A126283
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10^3.at n=7A127028
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n in which the maximal number of initial consecutive columns ending at the same level is k (1 <= k <= n).at n=38A140709
- Numbers A141427(k) such that the three numbers A141427(k) -/+ 3 and A141427(k) + 1 are all prime.at n=43A144206
- 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), (-1, 1, 1), (0, -1, 1), (0, 1, -1), (1, 0, 0)}.at n=8A148844
- a(n) = 9*n^2 + n.at n=24A154517
- a(n) = 625*n^2 + 25.at n=2A157915