4837
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5536
- Proper Divisor Sum (Aliquot Sum)
- 699
- 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
- 4140
- Möbius Function
- 1
- Radical
- 4837
- 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
- 59
- 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
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=26A005892
- Coordination sequence T1 for Zeolite Code ATO.at n=46A008265
- Number of 3's in all partitions of n.at n=28A024787
- a(n) = T(n, 2*n-5), T given by A027926.at n=13A027928
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+7 or 20k-7. Also number of partitions in which no odd part is repeated, with at most 3 parts of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=43A036027
- Numbers whose base-5 representation contains exactly three 2's and two 3's.at n=15A045276
- a(n) = T(n,n-5), array T as in A055801.at n=28A055805
- Numbers k such that prime(k) + prime(k+1) is a square.at n=20A064397
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 5.at n=41A064903
- Number of distinct products i*j*k for 1 <= i <= j < k <= n.at n=42A100435
- Indices of primes in sequence defined by A(0) = 61, A(n) = 10*A(n-1) + 81 for n > 0.at n=20A101541
- Number of partitions of n in which each odd part has odd multiplicity and each even part has even multiplicity.at n=48A102247
- Number of squares on infinite chessboard that a knight can reach in n moves from a fixed square.at n=26A118312
- Numbers k such that 1 + k + k^3 + k^5 + k^7 + k^9 + k^11 + k^13 + k^15 + k^17 + k^19 + k^21 + k^23 + k^25 + k^27 + k^29 + k^31 + k^33 + k^35 + k^37 + k^39 + k^41 + k^43 is prime.at n=40A124200
- Positive integers whose sixth power is the sum of seven sixth powers (smallest primitive solutions).at n=12A132410
- Numbers k such that prime(k) + prime(k+1) is a perfect power.at n=26A132746
- a(n) = 7*n^2 + 4*n + 1.at n=27A135704
- 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, 0, -1), (1, 1, 0)}.at n=9A148567
- Table, read by antidiagonals, in which the n-th row comprises A214206(n) in position 0 followed by a second order recursive series G in which each product G(i)*G(i+1) lies in the same row of A001477 (interpreted as a square array - see below).at n=22A182441
- Number of (n+2) X 5 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.at n=7A184542