5946
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11904
- Proper Divisor Sum (Aliquot Sum)
- 5958
- 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
- 1980
- Möbius Function
- -1
- Radical
- 5946
- 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
- 98
- Smith Number
- yes
- 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 whose set of base-7 digits is {2,3}.at n=39A032807
- Sets of 4 consecutive numbers with equal number of divisors.at n=15A039665
- a(n) = A048141(3*n+2).at n=47A051060
- Numbers which are the sum of their proper divisors containing the digit 9.at n=20A059468
- Number of stars of visual magnitude n.at n=7A072171
- Interprimes which are of the form s*prime, s=6.at n=43A075281
- Number of partitions of 2*n with no part divisible by 3 and all odd parts occurring with even multiplicities.at n=25A098151
- Write the natural numbers as an infinite sequence of digits, starting at the left; a(n) is the subset (i.e., the position in this sequence of the "counting digits") of the first digit of the n-th square.at n=41A105314
- Number of paw-free Berge perfect graphs on n nodes.at n=9A123445
- Numbers k such that the numerator of the Bernoulli number B(2k) ends with the digits 691.at n=20A132184
- Aliquot sequence starting at 3630.at n=1A143930
- Coefficients for expansion of (g(x)d/dx)^n g(x); refined Eulerian numbers for calculating compositional inverse of h(x) = (d/dx)^(-1) 1/g(x); iterated derivatives as infinitesimal generators of flows.at n=53A145271
- Sums of 3 consecutive semiprimes.at n=25A173968
- Sums of three consecutive numbers each of which is the product of two distinct primes and each of which has no exponent greater than one for either of its two prime factors.at n=23A173969
- Floor-Sqrt transform of Catalan numbers (A000108).at n=16A186546
- Number of 0..n arrays x(0..4) of 5 elements with zero 4th difference.at n=12A200156
- Number of 0..n arrays x(0..9) of 10 elements with zero 4th differences.at n=46A200372
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209996; see the Formula section.at n=50A209998
- Positive integers m with 2^(m-1)*phi(m) - 1 prime, where phi(.) is Euler's totient function.at n=26A236375
- Number of 4-separable partitions of n; see Comments.at n=55A239470