8494
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13248
- Proper Divisor Sum (Aliquot Sum)
- 4754
- 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
- 4080
- Möbius Function
- -1
- Radical
- 8494
- 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
- yes
- Odd
- no
Appears in sequences
- Sum 2^Fibonacci(i), i=2..n.at n=5A011455
- Generalized Catalan Numbers x^3*A(x)^2 + (x-1)*A(x) + 1 =0.at n=15A023431
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 1, 0, 1, 1.at n=17A025246
- T(n, 2*n-4), T given by A027960.at n=19A027966
- 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 92.at n=3A031590
- a(n) = floor(surface area of a sphere with radius n).at n=25A066644
- Numbers n such that sigma(n) = phi(n) + phi(n-1) + phi(n-2).at n=7A067202
- Numbers which are the sum of three positive cubes and divisible by 31.at n=39A104054
- a(n) is the least triprime T for which the Mertens function M(T) = n.at n=30A123174
- Triangle read by rows: T(n,k) is the number of 0-1-2 trees (i.e., ordered trees with all vertices of outdegree at most two) with n edges and k pairs of adjacent vertices of outdegree 2.at n=44A126218
- Triangle read by rows, 1 <= m <= n: t(n,m) = lcm(s(n,m), S(n,m)), where s(n,m) is an unsigned Stirling number of the first kind and S(n,m) is a Stirling number of the second kind.at n=16A128264
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 1, 1), (1, -1, 1), (1, 0, -1)}.at n=8A149040
- Records in A152968.at n=46A152973
- Number of triangles that can be built from rods with lengths 1,2,...,n by using and concatenating not necessarily all rods.at n=11A160456
- Number of lines through at least 2 points of a 5 X n grid of points.at n=39A160845
- Numbers n such that sum of the cubes of the digits of n^3 is a perfect cube.at n=43A164882
- Partial sums of A106116.at n=40A173112
- Start with 3. If a, b in sequence, so is ab+1.at n=29A180432
- Number of steps to reach 1 in '3x+1' (or Collatz) problem starting with the n-th Mersenne prime.at n=13A181777
- Number of numbers <= p^2 with largest prime factor <= p, where p is the n-th prime; a(0) = 1.at n=36A184677