8383
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8568
- Proper Divisor Sum (Aliquot Sum)
- 185
- 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
- 8200
- Möbius Function
- 1
- Radical
- 8383
- 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
- 158
- 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
- a(0) = 1, a(n) = 29*n^2 + 2 for n>0.at n=17A010019
- Numbers with exactly 7 1's in their ternary expansion.at n=29A023698
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 21 ones.at n=1A031789
- Numbers having three 4's in base 9.at n=34A043471
- Numbers whose consecutive digits differ by 5.at n=35A048407
- n-th 4k+1 prime times (n+1)st 4k+3 prime.at n=11A048628
- Composite numbers which in base 6 contain their largest proper factor as a substring.at n=2A063156
- Duplicate of A063156.at n=2A063876
- Triangle read by rows, in which n-th row contains smallest set of n consecutive numbers with distinct prime signatures.at n=53A083788
- a(n) = prime(n)*prime(n+3).at n=22A090090
- Values of n for which the concatenations 1nn1, 3nn3, 7nn7 and 9nn9 are all primes.at n=8A102504
- Where records occur in A134204.at n=51A133245
- Triangle T(n, k, q) = Sum_{j=0..10} q^j * floor( binomial(n+1,k)*binomial(n-1,k-1)/(2^j*(n+1)) ) for q = 3, read by rows.at n=30A174045
- Triangle T(n, k, q) = Sum_{j=0..10} q^j * floor( binomial(n+1,k)*binomial(n-1,k-1)/(2^j*(n+1)) ) for q = 3, read by rows.at n=33A174045
- Double primes: concatenation of the n-th prime with itself.at n=22A176597
- Values x for records of the minima of the positive distance d between the eleventh power of a positive integer x and the square of an integer y such that d = x^11 - y^2 (x <> k^2 and y <> k^11).at n=40A179794
- Numbers n such that 4n+1 is a palindromic prime.at n=25A192261
- Monotonic ordering of set S generated by these rules: if x and y are in S then 5xy-x-y is in S, and 1 is in S.at n=32A192528
- Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*x^(n) which is the denominator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = (x + 2)/(x + 1).at n=50A231733
- S_9 sequence in partition of integers > 1 described in A240521.at n=28A240536