8493
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12000
- Proper Divisor Sum (Aliquot Sum)
- 3507
- 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
- 5328
- Möbius Function
- -1
- Radical
- 8493
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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 k + sum of its prime factors = (k+1) + sum of its prime factors.at n=20A020700
- 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=23A025099
- Lucky numbers that are concatenations of n with n + 9.at n=10A032659
- Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.at n=25A039664
- Numbers n such that A048767(n+1)=A048767(n).at n=16A048769
- Numbers k > 1 such that, in base 4, k and k^2 contain the same digits in the same proportion.at n=25A061658
- a(0)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)= 1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals 2n.at n=46A070898
- Numbers n such that n + sum of prime factors of n = (n+1) + sum of prime factors of (n+1).at n=14A075654
- Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m.at n=31A111045
- a(n) is the least triprime T for which the Mertens function M(T) = n.at n=31A123174
- a(n) = c is least number such that 10^n/2 -/+ c are primes.at n=47A124049
- The Wiener index of the Dutch windmill graph D(5,n) (n>=1).at n=18A180579
- Number of strings of numbers x(i=1..6) in 0..n with sum i^2*x(i)^2 equal to n^2*36.at n=27A184244
- Monotonic ordering of set S generated by these rules: if x and y are in S then (x+1)(y+1) is in S, and 2 is in S.at n=29A192518
- Last n-digit number seen when scanning the decimal digits of log(10).at n=3A229126
- a(n) = smallest index i such that A010062(i) >= 2^n.at n=16A229167
- Terms of the sequence A145749 which are not of the form 2*p where p is prime.at n=5A244438
- Least number k >= 0 such that (n!+k)/n is prime.at n=56A245695
- Numbers k such that sigma(k) + phi(k) + d(k) = sigma(k+1) + phi(k+1) + d(k+1), where sigma(k) is the sum of the divisors of k, phi(k) the Euler totient function of k and d(k) the number of divisors of k.at n=4A259495
- Numbers k such that (11*10^k - 113) / 3 is prime.at n=16A280557