5933
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6300
- Proper Divisor Sum (Aliquot Sum)
- 367
- 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
- 5568
- Möbius Function
- 1
- Radical
- 5933
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 142
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=37A015990
- (s(n)+1)/9, where s(n)=n-th base 9 palindrome that starts with 8.at n=31A043079
- Number of ways to tile a 4 X n region with 1 X 1 and 2 X 2 tiles.at n=9A054854
- Number of ways to tile a 9 X n rectangle with 1 X 1 and 2 X 2 tiles.at n=4A063653
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.at n=29A064907
- Numbers which need nine 'Reverse and Add' steps to reach a palindrome.at n=36A065214
- Interprimes which are of the form s*prime, s=17.at n=3A075292
- a(n) = 4*(n+1)*n + 5.at n=38A078370
- Number of numbers k which give 1 after applying exactly n iterations of the 3k+1 algorithm (if a number is even, divide it by 2; if it is odd, multiply by 3 and add 1). This total includes numbers k which also give 1 for a smaller number of iterations (i.e., for this sequence we do not assume the algorithm halts when 1 is reached).at n=36A082538
- a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=5.at n=11A087958
- Sums of p-th to the q-th prime where p and q are consecutive primes.at n=43A114381
- Number of 6-almost primes less than or equal to 10^n.at n=5A120047
- Odd interprimes divisible by 17.at n=18A124620
- Triangle read by rows: T(k,n) is number of numbers <= 10^n that are products of k primes.at n=36A126280
- a(n) = floor((x^n - (1-x)^n)/sqrt(2)+ 1/2) where x = (sqrt(2)+1)/2.at n=47A136421
- Number of n X n binary matrices, symmetric under horizontal reflection, with no more than 1 one in any 2 X 2 subblock.at n=8A141482
- 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), (0, 1, 1), (1, -1, 0), (1, 0, -1)}.at n=8A148969
- Irregular triangle T(n, k) = [x^k]( p(n, x) ), where p(n, x) = ( (1-x)^(n+1) * Sum_{k >= 0} (2*k+1)^(n-1)*x^k )^2, read by rows.at n=33A165890
- Irregular triangle T(n, k) = [x^k]( p(n, x) ), where p(n, x) = ( (1-x)^(n+1) * Sum_{k >= 0} (2*k+1)^(n-1)*x^k )^2, read by rows.at n=27A165890
- T(n,k) = Half the number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock diagonal sum differing from its antidiagonal sum by more than 2.at n=29A179618