5892
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
- 12
- Divisor Sum
- 13776
- Proper Divisor Sum (Aliquot Sum)
- 7884
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1960
- Möbius Function
- 0
- Radical
- 2946
- 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
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=23A001209
- Coordination sequence for alpha-Mn, Position Mn1.at n=20A009950
- a(n) = (d(n) - r(n))/5, where d = A026037 and r is the periodic sequence with fundamental period (1,2,0,2,0).at n=42A026039
- Positive numbers having the same set of digits in base 6 and base 8.at n=34A037435
- Numbers whose base-3 representation contains exactly four 0's and four 2's.at n=24A045013
- a(n) = |{m : multiplicative order of 8 mod m = n}|.at n=41A059890
- Triangle read by rows: For n >= 0, k >= 0, T(n,k) is the number of permutations pi of n such that the total distance Sum_i abs(i-pi(i)) = 2k. Equivalently, k = Sum_i max(i-pi(i),0).at n=53A062869
- Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the group sum divided by n for the n-th group.at n=28A074131
- First occurrence of n as a term in the continued fraction for Pi/4.at n=45A076588
- Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=15A078612
- a(n) = Sum_{k=0..floor(n/2)} binomial(n,k)*4^(n-2*k).at n=6A100069
- Numbers k such that k and 8*k, taken together, are zeroless pandigital.at n=11A115932
- Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.at n=31A116721
- Square table, read by antidiagonals, of coefficients of x^k in the n-th self-composition of the g.f. of A120009, so that: T(n,k) = [x^k] { (x-x^2) o x/(1-n*x) o (1-sqrt(1-4*x))/2 } for n>=1, k>=1.at n=60A120013
- Coefficients of x^n in the n-th iteration of the g.f. of A120009, so that: a(n) = [x^n] { (x-x^2) o x/(1-n*x) o (1-sqrt(1-4*x))/2 } for n>=1.at n=5A120014
- Triangular array read by rows: for n, k >= 1, a(n+1, 1) = 2*a(n, n); a(n+1, k+1) = a(n, k)+a(n+1, k).at n=26A129340
- A090801(2n-1)+A090801(2n).at n=17A140958
- 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, 1), (-1, 0, 0), (-1, 1, 0), (0, 0, -1), (1, 0, 1)}.at n=8A149236
- a(n) = 4*n^2 + 3*n + 2.at n=38A185669
- Floor( ( n + 1/n )^6 ).at n=3A197605