4361
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 5130
- Proper Divisor Sum (Aliquot Sum)
- 769
- 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
- 3696
- Möbius Function
- 0
- Radical
- 623
- Omega Function (Ω)
- 3
- 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
- 139
- 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
- no
- Odd
- yes
Appears in sequences
- Number of graphical partitions (degree-vectors for simple graphs with n vertices, or possible ordered row-sum vectors for a symmetric 0-1 matrix with diagonal values 0).at n=9A004251
- Coordination sequence T3 for Zeolite Code LAU.at n=47A008126
- Numbers k such that the continued fraction for sqrt(k) has period 48.at n=31A020387
- Expansion of e.g.f.: exp(x/(1-2*x)).at n=5A025168
- a(n) = (d(n)-r(n))/5, where d = A026054 and r is the periodic sequence with fundamental period (3,3,0,0,4).at n=45A026056
- Coordination sequence T1 for Zeolite Code SFF.at n=44A038437
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i) where T is A049627.at n=43A049630
- a(n) = Sum_{i=0..floor(n/2)} T(2i+1,n-2i-1) where T is A049627.at n=43A049631
- Numbers k such that 273*2^k + 1 is prime.at n=31A053353
- a(n)-th star number (A003154) is a square.at n=4A054318
- Numbers that in base 2 need twelve 'Reverse and Add' steps to reach a palindrome.at n=37A066133
- The prime factors of n are also prime factors of the decimal encoding (A067599) of the prime factorization of n.at n=18A067671
- Numbers n such that 6n+5, 6n+11, 6n+17, 6n+23 are consecutive primes or 6n+1, 6n+7, 6n+13, 6n+19 are consecutive primes.at n=16A090833
- Numbers k such that 6*k+5, 6*k+11, 6*k+17, 6*k+23 are consecutive primes.at n=9A090836
- The first pair of digits sums up to 7. So does the second pair. And the third one and the fourth one, etc., with a(n) < a(n+1). When constructing the sequence, choose the next digits so as to slow the growth of the sequence as much as possible.at n=56A101325
- Main diagonal of A101858.at n=34A101863
- Sum of the left diagonal in ordered 3 X 3 prime squares.at n=25A105090
- Numbers n such that googol - n is prime.at n=14A108251
- Sum of primes q with prime(n) < q < 2*prime(n).at n=30A108313
- Number of partitions of n such that the size of the tail below the Durfee square is equal to the size of the tail to the right of the Durfee square.at n=47A114424