8453
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 187
- 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
- 8268
- Möbius Function
- 1
- Radical
- 8453
- 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
- 83
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=21A020415
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026659.at n=18A026669
- Numbers whose set of base-7 digits is {3,4}.at n=35A032831
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 20.at n=20A050969
- Operation count to create all permutations of n distinct elements using the "streamlined" version of Knuth's Algorithm L (lexicographic permutation generation).at n=5A079755
- Minimal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=35A110611
- Start of the first run of exactly n integers in A014134.at n=10A140867
- prime(n)*( prime(n)-n ).at n=27A161522
- Partial sums of floor(2^n/31).at n=16A178459
- Triangle in which row n has n semiprimes such that (p+1)(q+1) is the same for each semiprime pq and (p+1)(q+1) is as small as possible.at n=44A180333
- Squarefree semiprimes k such that (m+1)^2-k is also a square, where m = ceiling(sqrt(k)).at n=40A180656
- Riordan matrix (1/(x+sqrt(1-4x)),(1-sqrt(1-4x))/(2(x+sqrt(1-4x)))).at n=49A188513
- Semiprimes whose prime factors are of equal binary length and which differ from each other in exactly two bit positions.at n=27A261074
- Ulam numbers n such that 3*n is also an Ulam number.at n=35A285885
- Numbers k such that (44*10^k - 503)/9 is prime.at n=16A294127
- a(n) = Sum_{k=1..n} k^2*phi(k), where phi is the Euler totient function A000010.at n=14A319087
- Number of integer partitions of n whose run-lengths are not unimodal.at n=38A332281
- a(n) = 3*binomial(n,4) - 6*binomial(n,3) + 4*binomial(n,2) - 2.at n=20A335694
- Terms of A339863 that are congruent to 5 modulo 6: numbers k == 5 (mod 6) such that A005179(k-1) > A005179(k) < A005179(k+1) >A005179(k+2) < A005179(k+3).at n=38A349940
- Numbers m such that Stern polynomial B(m,x) has no irreducible polynomial factors that themselves are Stern polynomials. The initial a(1) = 1 is included by convention.at n=10A389918