4243
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
- 4244
- 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
- 4242
- Möbius Function
- -1
- Radical
- 4243
- 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
- 108
- 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
- 582
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = n concatenated with n + 1.at n=41A001704
- Coordination sequence T4 for Zeolite Code RUT.at n=43A009900
- Numbers k such that the continued fraction for sqrt(k) has period 62.at n=9A020401
- Primes that remain prime through 3 iterations of function f(x) = 6x + 5.at n=36A023288
- Primes that remain prime through 4 iterations of function f(x) = 6x + 5.at n=9A023317
- n written in fractional base 6/4.at n=27A024637
- Coordination sequence T4 for Zeolite Code MWW.at n=43A024989
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...).at n=19A025099
- a(n)/1000 gives sqrt(n) to 3 places after the decimal point.at n=17A027662
- Primes formed by concatenating n with n+1.at n=5A030458
- Pair up the numbers.at n=21A030656
- 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=2A031563
- Lower prime of a difference of 10 between consecutive primes.at n=55A031928
- Numbers whose base-5 representation contains exactly two 1's and three 3's.at n=24A045243
- Discriminants of imaginary quadratic fields with class number 9 (negated).at n=19A046006
- T(n,n-1), array T as in A047150.at n=7A047153
- Integers n such that A047988(n)=3.at n=18A047986
- Primes whose consecutive digits differ by 1 or 2.at n=41A048413
- Concatenate "n" and "nextprime(n)".at n=41A049852
- Primes of the form 2*n^2 + 11.at n=27A050265