4423
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4424
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 4422
- Möbius Function
- -1
- Radical
- 4423
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 77
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 602
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.at n=19A000043
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=29A001136
- Degrees of primitive irreducible trinomials: n such that 2^n - 1 is a Mersenne prime and x^n + x^k + 1 is a primitive irreducible polynomial over GF(2) for some k with 0 < k < n.at n=13A001153
- Primes of form k^2 + k + 1.at n=22A002383
- Coordination sequence T1 for Zeolite Code YUG.at n=43A008247
- Engel expansion of 1/Pi.at n=6A014012
- Numbers k such that the continued fraction for sqrt(k) has period 56.at n=16A020395
- Primes that remain prime through 2 iterations of the function f(x) = 5x + 8.at n=37A023255
- Primes that remain prime through 3 iterations of function f(x) = 5x + 8.at n=13A023286
- Every suffix prime and no 0 digits in base 5 (written in base 5).at n=12A024780
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=36A024834
- a(n) = [ Sum{(sqrt(j+1)-sqrt(i+1))^2} ], 1 <= i < j <= n.at n=43A025222
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 65.at n=16A031563
- Lower prime of a difference of 18 between consecutive primes.at n=13A031936
- Exactly 5 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a lucky number.at n=22A032701
- Primes of the form p^k - p + 1 for prime p.at n=12A034915
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5) <= cn(1,5).at n=52A036846
- Coordination sequence Z12 for Zeolite Code STT.at n=44A038416
- Recursive prime generating sequence.at n=38A039726
- Numerators of continued fraction convergents to sqrt(246).at n=5A041460