5949
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8606
- Proper Divisor Sum (Aliquot Sum)
- 2657
- 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
- 3960
- Möbius Function
- 0
- Radical
- 1983
- 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
- 98
- 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
- Powers of fifth root of 5 rounded to nearest integer.at n=27A018127
- Powers of fifth root of 5 rounded up.at n=27A018128
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=12A020413
- Number of polyhexes of class PF2 with C_{2n} symmetry.at n=7A030520
- Numbers k such that k(k+1)(k+2)...(k+9) / (k+(k+1)+(k+2)+...+(k+9)) is an integer.at n=32A032782
- Number of partitions satisfying cn(0,5) + cn(1,5) < cn(2,5) + cn(3,5) and cn(0,5) + cn(4,5) < cn(2,5) + cn(3,5).at n=35A039884
- Numbers whose base-5 representation contains exactly two 2's and three 4's.at n=14A045288
- n plus a googol is prime.at n=17A049014
- Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of m; set a(n) = -1 if some fraction i/n never appears.at n=11A066849
- Largest k such that round(1/(sqrt(prime(k+1))-sqrt(prime(k)))) = n where prime(n) denotes the n-th prime (conjectured values).at n=7A078693
- Values of k that show the slow decrease in the larger values of the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.at n=14A084976
- Number of consecutive prime runs of 2 primes congruent to 3 mod 4 below 10^n.at n=5A092640
- Values of r such that N(r)/r^2 > Pi, where N(r) is the number of integer lattice points (x,y) inside or on a circle of radius r.at n=35A093832
- Where the records (A098968) occur in A046930 (if initial term is 0 not 1).at n=21A098969
- Conjectured numbers n such that the trajectory of n as defined in A003508 is unique.at n=23A105233
- Least positive k such that 2^n + k is a Chen prime and 2^n + k + 2 is a brilliant number.at n=36A109364
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 1100-0111-0101 pattern in any orientation.at n=9A147222
- 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), (1, -1, 1), (1, 0, 0), (1, 1, -1)}.at n=9A148252
- Numbers k such that (k^3 + 2, n^3 + 4) is a twin prime pair.at n=34A178337
- Number of distinct values of Sum_{i=0..n} x(i)*binomial(n,i), where the x(i) is a vector of length n+1 that runs through all combinations of {0, 1}.at n=15A205536