5846
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9120
- Proper Divisor Sum (Aliquot Sum)
- 3274
- 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
- 2808
- Möbius Function
- -1
- Radical
- 5846
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 142
- 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
- Number of rooted toroidal maps with 3 vertices and n faces and no isthmuses.at n=2A006426
- If a, b in sequence, so is ab+10.at n=29A009368
- Numbers k such that the continued fraction for sqrt(k) has period 50.at n=39A020389
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=30A025001
- a(n) = Sum_{d|n} p(d), where p(d) = A000041 = number of partitions of d.at n=29A047968
- Numbers k such that 273*2^k + 1 is prime.at n=32A053353
- Numbers k such that the k-th term of the EKG sequence (A064413(k)) has more than one controlling prime.at n=23A073735
- a(n) = (prime(n)+1)*n.at n=37A083726
- Kekulé numbers for certain benzenoids.at n=4A110692
- Begin with 1,2 In binary 1, 10. To get the sequence, left pad binary number with its precedent: 1,10, 110, 10110, 11010110, 1011011010110, etc. Note the number of bits of the n-th term is the (n-1)st Fibonacci number. Now convert back to decimal 1,2,6,22,214,5846, ...at n=5A111061
- Irregular array where the n-th row are the divisors, not occurring earlier in the sequence, of the sum of the terms in all previous rows. a(1)=3.at n=33A120577
- Number of P_4-reducible perfect graphs on n nodes.at n=9A123440
- Retrograde trajectory of 13 under map n -> A132948(n).at n=45A132947
- Numbers k such that the three numbers k+3, k-3 and k+5 are all prime.at n=41A144842
- a(n) = (9*n+2)*(9*n+7).at n=8A177072
- Number of strings of numbers x(i=1..n) in 0..2 with sum i^2*x(i) equal to n^2*2.at n=17A183946
- Half the number of 0..2 arrays of length n+2 with second differences nonzero.at n=7A212776
- T(n,k)=Half the number of 0..k arrays of length n+2 with second differences nonzero.at n=43A212782
- Numbers n such that A234519(n) = n.at n=32A234524
- Number of partitions of n such that the successive differences of consecutive parts are nondecreasing.at n=51A240026