5862
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11736
- Proper Divisor Sum (Aliquot Sum)
- 5874
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1952
- Möbius Function
- -1
- Radical
- 5862
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 36
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 76.at n=6A031574
- Let p1, p2 be first pair of consecutive primes with difference 2n; let p3, p4 be 2nd such pair; sequence gives "wadi" value p3-p1.at n=25A046728
- a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3), ..., a(n)] and [0; a(1), a(2), a(3), ..., a(n)].at n=44A058082
- Numbers which are the sum of their proper divisors containing the digit 9.at n=18A059468
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=19A090495
- The sixth column of triangle A091492, excluding leading zeros.at n=42A091498
- Let p = n-th irregular prime, A000928(n). Then a(n) = smallest value of m such that numerator(Bernoulli(2*m)/(2*m)) / numerator(Bernoulli(2*m)/(2*m*(2*m-1))) equals p.at n=37A092291
- Unicode codes for the lunation runes, used in certain medieval Scandinavian perpetual calendar staves as golden numbers 1-19.at n=15A098476
- After the first two terms, each subsequent term is the smallest integer that is an outlier of the previous dataset, based on the criterion of 3 sample standard deviations above the mean.at n=35A103231
- The initial decimal digits of 2^a(n) are the decimal digits of n followed by n.at n=42A171652
- Numbers n such that n, n+1 and n+2 have the same number of divisors, and that number of divisors is larger than 4.at n=38A171666
- Irregular triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k isolated fixed points.at n=24A184178
- Number of nX2 0..2 arrays with every 1 immediately preceded by 0 to the left or above, no 0 immediately preceded by a 0, and every 2 immediately preceded by 0 1 to the left or above.at n=17A203175
- Smallest sets of 5 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=43A228962
- Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00010101 or 01010101.at n=9A261285
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00010101 or 01010101.at n=45A261292
- a(n) = Sum_{k=0..n} k*A000009(k).at n=20A270105
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 318", based on the 5-celled von Neumann neighborhood.at n=23A271252
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 421", based on the 5-celled von Neumann neighborhood.at n=19A272051
- Partial sums of A037276.at n=23A287883